H-Termination proof of /home/matraf/haskell/eval_FullyBlown

MAYBE 182.304 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could not be shown:

↳ HASKELL

  ↳ LR

mainModule Main

((rangeSize :: Ix a => (a,a) -> Int) :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

Lambda Reductions:
The following Lambda expression

\z→if y >= z && z >= x then z : [] else []

is transformed to

range0 y x z = if y >= z && z >= x then z : [] else []

The following Lambda expression

\s→if y > s then 1 else 0

is transformed to

index0 y s = if y > s then 1 else 0

The following Lambda expression

\lv1→

case lv1 of
z2 → (z0,z1,z2) : []

_ → []

is transformed to

range1 z0 z1 lv1 =

case lv1 of
z2 → (z0,z1,z2) : []

_ → []

The following Lambda expression

\lv2→

case lv2 of
z1 → concatMap (range1 z0 z1) (range (x2,y2))

_ → []

is transformed to

range2 z0 x2 y2 lv2 =

case lv2 of
z1 → concatMap (range1 z0 z1) (range (x2,y2))

_ → []

The following Lambda expression

\lv3→

case lv3 of
z0 → concatMap (range2 z0 x2 y2) (range (x1,y1))

_ → []

is transformed to

range3 x2 y2 x1 y1 lv3 =

case lv3 of
z0 → concatMap (range2 z0 x2 y2) (range (x1,y1))

_ → []

The following Lambda expression

\s→if y > s then 1 else 0

is transformed to

index1 y s = if y > s then 1 else 0

The following Lambda expression

\z→if y >= z && z >= x then z : [] else []

is transformed to

range4 y x z = if y >= z && z >= x then z : [] else []

The following Lambda expression

\lv1→

case lv1 of
z1 → (z0,z1) : []

_ → []

is transformed to

range5 z0 lv1 =

case lv1 of
z1 → (z0,z1) : []

_ → []

The following Lambda expression

\lv2→

case lv2 of
z0 → concatMap (range5 z0) (range (x1,y1))

_ → []

is transformed to

range6 x1 y1 lv2 =

case lv2 of
z0 → concatMap (range5 z0) (range (x1,y1))

_ → []

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

mainModule Main

((rangeSize :: Ix a => (a,a) -> Int) :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

Case Reductions:
The following Case expression

case lv1 of
z1 → (z0,z1) : []

_ → []

is transformed to

range50 z0 z1 = (z0,z1) : []

range50 z0 _ = []

The following Case expression

case lv2 of
z1 → concatMap (range1 z0 z1) (range (x2,y2))

_ → []

is transformed to

range20 z0 x2 y2 z1 = concatMap (range1 z0 z1) (range (x2,y2))

range20 z0 x2 y2 _ = []

The following Case expression

case lv2 of
z0 → concatMap (range5 z0) (range (x1,y1))

_ → []

is transformed to

range60 x1 y1 z0 = concatMap (range5 z0) (range (x1,y1))

range60 x1 y1 _ = []

The following Case expression

case lv3 of
z0 → concatMap (range2 z0 x2 y2) (range (x1,y1))

_ → []

is transformed to

range30 x2 y2 x1 y1 z0 = concatMap (range2 z0 x2 y2) (range (x1,y1))

range30 x2 y2 x1 y1 _ = []

The following Case expression

case lv1 of
z2 → (z0,z1,z2) : []

_ → []

is transformed to

range10 z0 z1 z2 = (z0,z1,z2) : []

range10 z0 z1 _ = []

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

mainModule Main

((rangeSize :: Ix a => (a,a) -> Int) :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

If Reductions:
The following If expression

if y >= z && z >= x then z : [] else []

is transformed to

range00 z True = z : []

range00 z False = []

The following If expression

if y >= z && z >= x then z : [] else []

is transformed to

range40 z True = z : []

range40 z False = []

The following If expression

if y > s then 1 else 0

is transformed to

index00 True = 1

index00 False = 0

The following If expression

if y > s then 1 else 0

is transformed to

index10 True = 1

index10 False = 0

The following If expression

if y >= z && z >= x then sum (map (index0 y) (range (x,y))) else error []

is transformed to

index2 y x True = sum (map (index0 y) (range (x,y)))

index2 y x False = error []

The following If expression

if y >= z && z >= x then sum (map (index1 y) (range (x,y))) else error []

is transformed to

index3 y x True = sum (map (index1 y) (range (x,y)))

index3 y x False = error []

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

mainModule Main

((rangeSize :: Ix a => (a,a) -> Int) :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.
Binding Reductions:
The bind variable of the following binding Pattern

r@(vv,vw)

is replaced by the following term

(vv,vw)

The bind variable of the following binding Pattern

b@(wz,xu)

is replaced by the following term

(wz,xu)

The bind variable of the following binding Pattern

b@(xv,xw)

is replaced by the following term

(xv,xw)

The bind variable of the following binding Pattern

b@(xx,xy)

is replaced by the following term

(xx,xy)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

mainModule Main

((rangeSize :: Ix a => (a,a) -> Int) :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

compare x y

| x == y

= EQ

| x <= y

= LT

| otherwise

= GT

is transformed to

compare x y = compare3 x y

compare1 x y True = LT

compare1 x y False = compare0 x y otherwise

compare0 x y True = GT

compare2 x y True = EQ

compare2 x y False = compare1 x y (x <= y)

compare3 x y = compare2 x y (x == y)

The following Function with conditions

rangeSize (vv,vw)

| null (range (vv,vw))

= 0

| otherwise

= index (vv,vw) vw + 1

is transformed to

rangeSize (vv,vw) = rangeSize2 (vv,vw)

rangeSize0 vv vw True = index (vv,vw) vw + 1

rangeSize1 vv vw True = 0

rangeSize1 vv vw False = rangeSize0 vv vw otherwise

rangeSize2 (vv,vw) = rangeSize1 vv vw (null (range (vv,vw)))

The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

takeWhile p [] = []

takeWhile p (x : xs)

| p x

= x : takeWhile p xs

| otherwise

= []

is transformed to

takeWhile p [] = takeWhile3 p []

takeWhile p (x : xs) = takeWhile2 p (x : xs)

takeWhile0 p x xs True = []

takeWhile1 p x xs True = x : takeWhile p xs

takeWhile1 p x xs False = takeWhile0 p x xs otherwise

takeWhile2 p (x : xs) = takeWhile1 p x xs (p x)

takeWhile3 p [] = []

takeWhile3 yx yy = takeWhile2 yx yy

The following Function with conditions

index (wz,xu) i

| inRange (wz,xu) i

= fromInteger (i - wz)

| otherwise

= error []

is transformed to

index (wz,xu) i = index6 (wz,xu) i

index5 wz xu i True = fromInteger (i - wz)

index5 wz xu i False = index4 wz xu i otherwise

index4 wz xu i True = error []

index6 (wz,xu) i = index5 wz xu i (inRange (wz,xu) i)

The following Function with conditions

index (xv,xw) ci

| inRange (xv,xw) ci

= fromEnum ci - fromEnum xv

| otherwise

= error []

is transformed to

index (xv,xw) ci = index9 (xv,xw) ci

index7 xv xw ci True = error []

index8 xv xw ci True = fromEnum ci - fromEnum xv

index8 xv xw ci False = index7 xv xw ci otherwise

index9 (xv,xw) ci = index8 xv xw ci (inRange (xv,xw) ci)

The following Function with conditions

index (xx,xy) i

| inRange (xx,xy) i

= i - xx

| otherwise

= error []

is transformed to

index (xx,xy) i = index13 (xx,xy) i

index12 xx xy i True = i - xx

index12 xx xy i False = index11 xx xy i otherwise

index11 xx xy i True = error []

index13 (xx,xy) i = index12 xx xy i (inRange (xx,xy) i)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

mainModule Main

((rangeSize :: Ix a => (a,a) -> Int) :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

fromEnum c <= i && i <= fromEnum c'

where

i = fromEnum ci

are unpacked to the following functions on top level

inRangeI zw = fromEnum zw

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

mainModule Main

((rangeSize :: Ix a => (a,a) -> Int) :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                              ↳ Narrow

mainModule Main

(rangeSize :: Ix a => (a,a) -> Int)

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="rangeSize\n  Ix a",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="rangeSize zx3\n  Ix a",fontsize=16,color="blue",shape="box"];10821[label="rangeSize :: ((@2) ((@3) a b c) ((@3) a b c)) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10821[label="",style="solid", color="blue", weight=9];
10821 -> 4[label="",style="solid", color="blue", weight=3];
10822[label="rangeSize :: ((@2) ((@2) a b) ((@2) a b)) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10822[label="",style="solid", color="blue", weight=9];
10822 -> 5[label="",style="solid", color="blue", weight=3];
10823[label="rangeSize :: ((@2) Integer Integer) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10823[label="",style="solid", color="blue", weight=9];
10823 -> 6[label="",style="solid", color="blue", weight=3];
10824[label="rangeSize :: ((@2) () ()) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10824[label="",style="solid", color="blue", weight=9];
10824 -> 7[label="",style="solid", color="blue", weight=3];
10825[label="rangeSize :: ((@2) Char Char) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10825[label="",style="solid", color="blue", weight=9];
10825 -> 8[label="",style="solid", color="blue", weight=3];
10826[label="rangeSize :: ((@2) Int Int) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10826[label="",style="solid", color="blue", weight=9];
10826 -> 9[label="",style="solid", color="blue", weight=3];
10827[label="rangeSize :: ((@2) Ordering Ordering) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10827[label="",style="solid", color="blue", weight=9];
10827 -> 10[label="",style="solid", color="blue", weight=3];
10828[label="rangeSize :: ((@2) Bool Bool) -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 10828[label="",style="solid", color="blue", weight=9];
10828 -> 11[label="",style="solid", color="blue", weight=3];
4[label="rangeSize zx3\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="triangle"];10829[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];4 -> 10829[label="",style="solid", color="burlywood", weight=9];
10829 -> 12[label="",style="solid", color="burlywood", weight=3];
5[label="rangeSize zx3\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="triangle"];10830[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];5 -> 10830[label="",style="solid", color="burlywood", weight=9];
10830 -> 13[label="",style="solid", color="burlywood", weight=3];
6[label="rangeSize zx3",fontsize=16,color="burlywood",shape="triangle"];10831[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];6 -> 10831[label="",style="solid", color="burlywood", weight=9];
10831 -> 14[label="",style="solid", color="burlywood", weight=3];
7[label="rangeSize zx3",fontsize=16,color="burlywood",shape="triangle"];10832[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];7 -> 10832[label="",style="solid", color="burlywood", weight=9];
10832 -> 15[label="",style="solid", color="burlywood", weight=3];
8[label="rangeSize zx3",fontsize=16,color="burlywood",shape="triangle"];10833[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];8 -> 10833[label="",style="solid", color="burlywood", weight=9];
10833 -> 16[label="",style="solid", color="burlywood", weight=3];
9[label="rangeSize zx3",fontsize=16,color="burlywood",shape="triangle"];10834[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];9 -> 10834[label="",style="solid", color="burlywood", weight=9];
10834 -> 17[label="",style="solid", color="burlywood", weight=3];
10[label="rangeSize zx3",fontsize=16,color="burlywood",shape="triangle"];10835[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];10 -> 10835[label="",style="solid", color="burlywood", weight=9];
10835 -> 18[label="",style="solid", color="burlywood", weight=3];
11[label="rangeSize zx3",fontsize=16,color="burlywood",shape="triangle"];10836[label="zx3/(zx30,zx31)",fontsize=10,color="white",style="solid",shape="box"];11 -> 10836[label="",style="solid", color="burlywood", weight=9];
10836 -> 19[label="",style="solid", color="burlywood", weight=3];
12[label="rangeSize (zx30,zx31)\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];12 -> 20[label="",style="solid", color="black", weight=3];
13[label="rangeSize (zx30,zx31)\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];13 -> 21[label="",style="solid", color="black", weight=3];
14[label="rangeSize (zx30,zx31)",fontsize=16,color="black",shape="box"];14 -> 22[label="",style="solid", color="black", weight=3];
15[label="rangeSize (zx30,zx31)",fontsize=16,color="black",shape="box"];15 -> 23[label="",style="solid", color="black", weight=3];
16[label="rangeSize (zx30,zx31)",fontsize=16,color="black",shape="box"];16 -> 24[label="",style="solid", color="black", weight=3];
17[label="rangeSize (zx30,zx31)",fontsize=16,color="black",shape="box"];17 -> 25[label="",style="solid", color="black", weight=3];
18[label="rangeSize (zx30,zx31)",fontsize=16,color="black",shape="box"];18 -> 26[label="",style="solid", color="black", weight=3];
19[label="rangeSize (zx30,zx31)",fontsize=16,color="black",shape="box"];19 -> 27[label="",style="solid", color="black", weight=3];
20[label="rangeSize2 (zx30,zx31)\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];20 -> 28[label="",style="solid", color="black", weight=3];
21[label="rangeSize2 (zx30,zx31)\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];21 -> 29[label="",style="solid", color="black", weight=3];
22[label="rangeSize2 (zx30,zx31)",fontsize=16,color="black",shape="box"];22 -> 30[label="",style="solid", color="black", weight=3];
23[label="rangeSize2 (zx30,zx31)",fontsize=16,color="black",shape="box"];23 -> 31[label="",style="solid", color="black", weight=3];
24[label="rangeSize2 (zx30,zx31)",fontsize=16,color="black",shape="box"];24 -> 32[label="",style="solid", color="black", weight=3];
25[label="rangeSize2 (zx30,zx31)",fontsize=16,color="black",shape="box"];25 -> 33[label="",style="solid", color="black", weight=3];
26[label="rangeSize2 (zx30,zx31)",fontsize=16,color="black",shape="box"];26 -> 34[label="",style="solid", color="black", weight=3];
27[label="rangeSize2 (zx30,zx31)",fontsize=16,color="black",shape="box"];27 -> 35[label="",style="solid", color="black", weight=3];
28[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="box"];10837[label="zx30/(zx300,zx301,zx302)",fontsize=10,color="white",style="solid",shape="box"];28 -> 10837[label="",style="solid", color="burlywood", weight=9];
10837 -> 36[label="",style="solid", color="burlywood", weight=3];
29[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="box"];10838[label="zx30/(zx300,zx301)",fontsize=10,color="white",style="solid",shape="box"];29 -> 10838[label="",style="solid", color="burlywood", weight=9];
10838 -> 37[label="",style="solid", color="burlywood", weight=3];
30[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))",fontsize=16,color="black",shape="box"];30 -> 38[label="",style="solid", color="black", weight=3];
31[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))",fontsize=16,color="burlywood",shape="box"];10839[label="zx30/()",fontsize=10,color="white",style="solid",shape="box"];31 -> 10839[label="",style="solid", color="burlywood", weight=9];
10839 -> 39[label="",style="solid", color="burlywood", weight=3];
32 -> 197[label="",style="dashed", color="red", weight=0];
32[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))",fontsize=16,color="magenta"];32 -> 198[label="",style="dashed", color="magenta", weight=3];
33[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))",fontsize=16,color="black",shape="box"];33 -> 41[label="",style="solid", color="black", weight=3];
34[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))",fontsize=16,color="black",shape="box"];34 -> 42[label="",style="solid", color="black", weight=3];
35[label="rangeSize1 zx30 zx31 (null (range (zx30,zx31)))",fontsize=16,color="black",shape="box"];35 -> 43[label="",style="solid", color="black", weight=3];
36[label="rangeSize1 (zx300,zx301,zx302) zx31 (null (range ((zx300,zx301,zx302),zx31)))\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="box"];10841[label="zx31/(zx310,zx311,zx312)",fontsize=10,color="white",style="solid",shape="box"];36 -> 10841[label="",style="solid", color="burlywood", weight=9];
10841 -> 44[label="",style="solid", color="burlywood", weight=3];
37[label="rangeSize1 (zx300,zx301) zx31 (null (range ((zx300,zx301),zx31)))\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="box"];10842[label="zx31/(zx310,zx311)",fontsize=10,color="white",style="solid",shape="box"];37 -> 10842[label="",style="solid", color="burlywood", weight=9];
10842 -> 45[label="",style="solid", color="burlywood", weight=3];
38[label="rangeSize1 zx30 zx31 (null (enumFromTo zx30 zx31))",fontsize=16,color="black",shape="box"];38 -> 46[label="",style="solid", color="black", weight=3];
39[label="rangeSize1 () zx31 (null (range ((),zx31)))",fontsize=16,color="burlywood",shape="box"];10843[label="zx31/()",fontsize=10,color="white",style="solid",shape="box"];39 -> 10843[label="",style="solid", color="burlywood", weight=9];
10843 -> 47[label="",style="solid", color="burlywood", weight=3];
198 -> 108[label="",style="dashed", color="red", weight=0];
198[label="range (zx30,zx31)",fontsize=16,color="magenta"];198 -> 209[label="",style="dashed", color="magenta", weight=3];
198 -> 210[label="",style="dashed", color="magenta", weight=3];
197[label="rangeSize1 zx30 zx31 (null zx31)",fontsize=16,color="burlywood",shape="triangle"];10845[label="zx31/zx310 : zx311",fontsize=10,color="white",style="solid",shape="box"];197 -> 10845[label="",style="solid", color="burlywood", weight=9];
10845 -> 211[label="",style="solid", color="burlywood", weight=3];
10846[label="zx31/[]",fontsize=10,color="white",style="solid",shape="box"];197 -> 10846[label="",style="solid", color="burlywood", weight=9];
10846 -> 212[label="",style="solid", color="burlywood", weight=3];
41[label="rangeSize1 zx30 zx31 (null (enumFromTo zx30 zx31))",fontsize=16,color="black",shape="box"];41 -> 49[label="",style="solid", color="black", weight=3];
42[label="rangeSize1 zx30 zx31 (null (concatMap (range4 zx31 zx30) (LT : EQ : GT : [])))",fontsize=16,color="black",shape="box"];42 -> 50[label="",style="solid", color="black", weight=3];
43[label="rangeSize1 zx30 zx31 (null (concatMap (range0 zx31 zx30) (False : True : [])))",fontsize=16,color="black",shape="box"];43 -> 51[label="",style="solid", color="black", weight=3];
44[label="rangeSize1 (zx300,zx301,zx302) (zx310,zx311,zx312) (null (range ((zx300,zx301,zx302),(zx310,zx311,zx312))))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];44 -> 52[label="",style="solid", color="black", weight=3];
45[label="rangeSize1 (zx300,zx301) (zx310,zx311) (null (range ((zx300,zx301),(zx310,zx311))))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];45 -> 53[label="",style="solid", color="black", weight=3];
46[label="rangeSize1 zx30 zx31 (null (numericEnumFromTo zx30 zx31))",fontsize=16,color="black",shape="box"];46 -> 54[label="",style="solid", color="black", weight=3];
47[label="rangeSize1 () () (null (range ((),())))",fontsize=16,color="black",shape="box"];47 -> 55[label="",style="solid", color="black", weight=3];
209[label="zx30",fontsize=16,color="green",shape="box"];210[label="zx31",fontsize=16,color="green",shape="box"];108[label="range (zx300,zx310)",fontsize=16,color="black",shape="triangle"];108 -> 134[label="",style="solid", color="black", weight=3];
211[label="rangeSize1 zx30 zx31 (null (zx310 : zx311))",fontsize=16,color="black",shape="box"];211 -> 233[label="",style="solid", color="black", weight=3];
212[label="rangeSize1 zx30 zx31 (null [])",fontsize=16,color="black",shape="box"];212 -> 234[label="",style="solid", color="black", weight=3];
49[label="rangeSize1 zx30 zx31 (null (numericEnumFromTo zx30 zx31))",fontsize=16,color="black",shape="box"];49 -> 57[label="",style="solid", color="black", weight=3];
50[label="rangeSize1 zx30 zx31 (null (concat . map (range4 zx31 zx30)))",fontsize=16,color="black",shape="box"];50 -> 58[label="",style="solid", color="black", weight=3];
51[label="rangeSize1 zx30 zx31 (null (concat . map (range0 zx31 zx30)))",fontsize=16,color="black",shape="box"];51 -> 59[label="",style="solid", color="black", weight=3];
52[label="rangeSize1 (zx300,zx301,zx302) (zx310,zx311,zx312) (null (concatMap (range3 zx302 zx312 zx301 zx311) (range (zx300,zx310))))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];52 -> 60[label="",style="solid", color="black", weight=3];
53[label="rangeSize1 (zx300,zx301) (zx310,zx311) (null (concatMap (range6 zx301 zx311) (range (zx300,zx310))))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];53 -> 61[label="",style="solid", color="black", weight=3];
54[label="rangeSize1 zx30 zx31 (null (takeWhile (flip (<=) zx31) (numericEnumFrom zx30)))",fontsize=16,color="black",shape="box"];54 -> 62[label="",style="solid", color="black", weight=3];
55[label="rangeSize1 () () (null (() : []))",fontsize=16,color="black",shape="box"];55 -> 63[label="",style="solid", color="black", weight=3];
134[label="enumFromTo zx300 zx310",fontsize=16,color="black",shape="box"];134 -> 168[label="",style="solid", color="black", weight=3];
233[label="rangeSize1 zx30 zx31 False",fontsize=16,color="black",shape="box"];233 -> 258[label="",style="solid", color="black", weight=3];
234[label="rangeSize1 zx30 zx31 True",fontsize=16,color="black",shape="box"];234 -> 259[label="",style="solid", color="black", weight=3];
57[label="rangeSize1 zx30 zx31 (null (takeWhile (flip (<=) zx31) (numericEnumFrom zx30)))",fontsize=16,color="black",shape="box"];57 -> 65[label="",style="solid", color="black", weight=3];
58[label="rangeSize1 zx30 zx31 (null (concat (map (range4 zx31 zx30) (LT : EQ : GT : []))))",fontsize=16,color="black",shape="box"];58 -> 66[label="",style="solid", color="black", weight=3];
59[label="rangeSize1 zx30 zx31 (null (concat (map (range0 zx31 zx30) (False : True : []))))",fontsize=16,color="black",shape="box"];59 -> 67[label="",style="solid", color="black", weight=3];
60[label="rangeSize1 (zx300,zx301,zx302) (zx310,zx311,zx312) (null (concat . map (range3 zx302 zx312 zx301 zx311)))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];60 -> 68[label="",style="solid", color="black", weight=3];
61[label="rangeSize1 (zx300,zx301) (zx310,zx311) (null (concat . map (range6 zx301 zx311)))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];61 -> 69[label="",style="solid", color="black", weight=3];
62[label="rangeSize1 zx30 zx31 (null (takeWhile (flip (<=) zx31) (zx30 : (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];62 -> 70[label="",style="solid", color="black", weight=3];
63[label="rangeSize1 () () False",fontsize=16,color="black",shape="box"];63 -> 71[label="",style="solid", color="black", weight=3];
168 -> 186[label="",style="dashed", color="red", weight=0];
168[label="map toEnum (enumFromTo (fromEnum zx300) (fromEnum zx310))",fontsize=16,color="magenta"];168 -> 187[label="",style="dashed", color="magenta", weight=3];
258[label="rangeSize0 zx30 zx31 otherwise",fontsize=16,color="black",shape="box"];258 -> 288[label="",style="solid", color="black", weight=3];
259[label="Pos Zero",fontsize=16,color="green",shape="box"];65[label="rangeSize1 zx30 zx31 (null (takeWhile (flip (<=) zx31) (zx30 : (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];65 -> 73[label="",style="solid", color="black", weight=3];
66[label="rangeSize1 zx30 zx31 (null (foldr (++) [] (map (range4 zx31 zx30) (LT : EQ : GT : []))))",fontsize=16,color="black",shape="box"];66 -> 74[label="",style="solid", color="black", weight=3];
67[label="rangeSize1 zx30 zx31 (null (foldr (++) [] (map (range0 zx31 zx30) (False : True : []))))",fontsize=16,color="black",shape="box"];67 -> 75[label="",style="solid", color="black", weight=3];
68[label="rangeSize1 (zx300,zx301,zx302) (zx310,zx311,zx312) (null (concat (map (range3 zx302 zx312 zx301 zx311) (range (zx300,zx310)))))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];68 -> 76[label="",style="solid", color="black", weight=3];
69[label="rangeSize1 (zx300,zx301) (zx310,zx311) (null (concat (map (range6 zx301 zx311) (range (zx300,zx310)))))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];69 -> 77[label="",style="solid", color="black", weight=3];
70[label="rangeSize1 zx30 zx31 (null (takeWhile2 (flip (<=) zx31) (zx30 : (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];70 -> 78[label="",style="solid", color="black", weight=3];
71[label="rangeSize0 () () otherwise",fontsize=16,color="black",shape="box"];71 -> 79[label="",style="solid", color="black", weight=3];
187 -> 135[label="",style="dashed", color="red", weight=0];
187[label="enumFromTo (fromEnum zx300) (fromEnum zx310)",fontsize=16,color="magenta"];187 -> 220[label="",style="dashed", color="magenta", weight=3];
187 -> 221[label="",style="dashed", color="magenta", weight=3];
186[label="map toEnum zx30",fontsize=16,color="burlywood",shape="triangle"];10849[label="zx30/zx300 : zx301",fontsize=10,color="white",style="solid",shape="box"];186 -> 10849[label="",style="solid", color="burlywood", weight=9];
10849 -> 222[label="",style="solid", color="burlywood", weight=3];
10850[label="zx30/[]",fontsize=10,color="white",style="solid",shape="box"];186 -> 10850[label="",style="solid", color="burlywood", weight=9];
10850 -> 223[label="",style="solid", color="burlywood", weight=3];
288[label="rangeSize0 zx30 zx31 True",fontsize=16,color="black",shape="box"];288 -> 312[label="",style="solid", color="black", weight=3];
73[label="rangeSize1 zx30 zx31 (null (takeWhile2 (flip (<=) zx31) (zx30 : (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];73 -> 81[label="",style="solid", color="black", weight=3];
74[label="rangeSize1 zx30 zx31 (null (foldr (++) [] (range4 zx31 zx30 LT : map (range4 zx31 zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];74 -> 82[label="",style="solid", color="black", weight=3];
75[label="rangeSize1 zx30 zx31 (null (foldr (++) [] (range0 zx31 zx30 False : map (range0 zx31 zx30) (True : []))))",fontsize=16,color="black",shape="box"];75 -> 83[label="",style="solid", color="black", weight=3];
76 -> 84[label="",style="dashed", color="red", weight=0];
76[label="rangeSize1 (zx300,zx301,zx302) (zx310,zx311,zx312) (null (foldr (++) [] (map (range3 zx302 zx312 zx301 zx311) (range (zx300,zx310)))))\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];76 -> 85[label="",style="dashed", color="magenta", weight=3];
76 -> 86[label="",style="dashed", color="magenta", weight=3];
76 -> 87[label="",style="dashed", color="magenta", weight=3];
76 -> 88[label="",style="dashed", color="magenta", weight=3];
76 -> 89[label="",style="dashed", color="magenta", weight=3];
76 -> 90[label="",style="dashed", color="magenta", weight=3];
76 -> 91[label="",style="dashed", color="magenta", weight=3];
77 -> 92[label="",style="dashed", color="red", weight=0];
77[label="rangeSize1 (zx300,zx301) (zx310,zx311) (null (foldr (++) [] (map (range6 zx301 zx311) (range (zx300,zx310)))))\n  Ix a  Ix b",fontsize=16,color="magenta"];77 -> 93[label="",style="dashed", color="magenta", weight=3];
77 -> 94[label="",style="dashed", color="magenta", weight=3];
77 -> 95[label="",style="dashed", color="magenta", weight=3];
77 -> 96[label="",style="dashed", color="magenta", weight=3];
77 -> 97[label="",style="dashed", color="magenta", weight=3];
78[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) (flip (<=) zx31 zx30)))",fontsize=16,color="black",shape="box"];78 -> 98[label="",style="solid", color="black", weight=3];
79[label="rangeSize0 () () True",fontsize=16,color="black",shape="box"];79 -> 99[label="",style="solid", color="black", weight=3];
220[label="fromEnum zx300",fontsize=16,color="black",shape="triangle"];220 -> 247[label="",style="solid", color="black", weight=3];
221 -> 220[label="",style="dashed", color="red", weight=0];
221[label="fromEnum zx310",fontsize=16,color="magenta"];221 -> 248[label="",style="dashed", color="magenta", weight=3];
135[label="enumFromTo zx300 zx310",fontsize=16,color="black",shape="triangle"];135 -> 169[label="",style="solid", color="black", weight=3];
222[label="map toEnum (zx300 : zx301)",fontsize=16,color="black",shape="box"];222 -> 249[label="",style="solid", color="black", weight=3];
223[label="map toEnum []",fontsize=16,color="black",shape="box"];223 -> 250[label="",style="solid", color="black", weight=3];
312 -> 1381[label="",style="dashed", color="red", weight=0];
312[label="index (zx30,zx31) zx31 + Pos (Succ Zero)",fontsize=16,color="magenta"];312 -> 1382[label="",style="dashed", color="magenta", weight=3];
81[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) (flip (<=) zx31 zx30)))",fontsize=16,color="black",shape="box"];81 -> 101[label="",style="solid", color="black", weight=3];
82[label="rangeSize1 zx30 zx31 (null ((++) range4 zx31 zx30 LT foldr (++) [] (map (range4 zx31 zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];82 -> 102[label="",style="solid", color="black", weight=3];
83[label="rangeSize1 zx30 zx31 (null ((++) range0 zx31 zx30 False foldr (++) [] (map (range0 zx31 zx30) (True : []))))",fontsize=16,color="black",shape="box"];83 -> 103[label="",style="solid", color="black", weight=3];
85[label="zx300\n  Ix a",fontsize=16,color="green",shape="box"];86[label="zx310\n  Ix a",fontsize=16,color="green",shape="box"];87[label="zx311\n  Ix a",fontsize=16,color="green",shape="box"];88[label="zx301\n  Ix a",fontsize=16,color="green",shape="box"];89[label="zx312\n  Ix a",fontsize=16,color="green",shape="box"];90[label="range (zx300,zx310)\n  Ix a",fontsize=16,color="blue",shape="box"];10855[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];90 -> 10855[label="",style="solid", color="blue", weight=9];
10855 -> 104[label="",style="solid", color="blue", weight=3];
10856[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];90 -> 10856[label="",style="solid", color="blue", weight=9];
10856 -> 105[label="",style="solid", color="blue", weight=3];
10857[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];90 -> 10857[label="",style="solid", color="blue", weight=9];
10857 -> 106[label="",style="solid", color="blue", weight=3];
10858[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];90 -> 10858[label="",style="solid", color="blue", weight=9];
10858 -> 107[label="",style="solid", color="blue", weight=3];
10859[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];90 -> 10859[label="",style="solid", color="blue", weight=9];
10859 -> 108[label="",style="solid", color="blue", weight=3];
10860[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];90 -> 10860[label="",style="solid", color="blue", weight=9];
10860 -> 109[label="",style="solid", color="blue", weight=3];
10861[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];90 -> 10861[label="",style="solid", color="blue", weight=9];
10861 -> 110[label="",style="solid", color="blue", weight=3];
10862[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];90 -> 10862[label="",style="solid", color="blue", weight=9];
10862 -> 111[label="",style="solid", color="blue", weight=3];
91[label="zx302\n  Ix a",fontsize=16,color="green",shape="box"];84[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) (null (foldr (++) [] (map (range3 zx14 zx17 zx13 zx16) zx18)))\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="triangle"];10863[label="zx18/zx180 : zx181",fontsize=10,color="white",style="solid",shape="box"];84 -> 10863[label="",style="solid", color="burlywood", weight=9];
10863 -> 112[label="",style="solid", color="burlywood", weight=3];
10864[label="zx18/[]",fontsize=10,color="white",style="solid",shape="box"];84 -> 10864[label="",style="solid", color="burlywood", weight=9];
10864 -> 113[label="",style="solid", color="burlywood", weight=3];
93[label="range (zx300,zx310)\n  Ix a",fontsize=16,color="blue",shape="box"];10865[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];93 -> 10865[label="",style="solid", color="blue", weight=9];
10865 -> 114[label="",style="solid", color="blue", weight=3];
10866[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];93 -> 10866[label="",style="solid", color="blue", weight=9];
10866 -> 115[label="",style="solid", color="blue", weight=3];
10867[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];93 -> 10867[label="",style="solid", color="blue", weight=9];
10867 -> 116[label="",style="solid", color="blue", weight=3];
10868[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];93 -> 10868[label="",style="solid", color="blue", weight=9];
10868 -> 117[label="",style="solid", color="blue", weight=3];
10869[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];93 -> 10869[label="",style="solid", color="blue", weight=9];
10869 -> 118[label="",style="solid", color="blue", weight=3];
10870[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];93 -> 10870[label="",style="solid", color="blue", weight=9];
10870 -> 119[label="",style="solid", color="blue", weight=3];
10871[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];93 -> 10871[label="",style="solid", color="blue", weight=9];
10871 -> 120[label="",style="solid", color="blue", weight=3];
10872[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];93 -> 10872[label="",style="solid", color="blue", weight=9];
10872 -> 121[label="",style="solid", color="blue", weight=3];
94[label="zx310\n  Ix a",fontsize=16,color="green",shape="box"];95[label="zx301\n  Ix a",fontsize=16,color="green",shape="box"];96[label="zx311\n  Ix a",fontsize=16,color="green",shape="box"];97[label="zx300\n  Ix a",fontsize=16,color="green",shape="box"];92[label="rangeSize1 (zx25,zx26) (zx27,zx28) (null (foldr (++) [] (map (range6 zx26 zx28) zx29)))\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="triangle"];10873[label="zx29/zx290 : zx291",fontsize=10,color="white",style="solid",shape="box"];92 -> 10873[label="",style="solid", color="burlywood", weight=9];
10873 -> 122[label="",style="solid", color="burlywood", weight=3];
10874[label="zx29/[]",fontsize=10,color="white",style="solid",shape="box"];92 -> 10874[label="",style="solid", color="burlywood", weight=9];
10874 -> 123[label="",style="solid", color="burlywood", weight=3];
98[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) ((<=) zx30 zx31)))",fontsize=16,color="black",shape="box"];98 -> 124[label="",style="solid", color="black", weight=3];
99 -> 1381[label="",style="dashed", color="red", weight=0];
99[label="index ((),()) () + Pos (Succ Zero)",fontsize=16,color="magenta"];99 -> 1383[label="",style="dashed", color="magenta", weight=3];
247[label="primCharToInt zx300",fontsize=16,color="burlywood",shape="box"];10876[label="zx300/Char zx3000",fontsize=10,color="white",style="solid",shape="box"];247 -> 10876[label="",style="solid", color="burlywood", weight=9];
10876 -> 276[label="",style="solid", color="burlywood", weight=3];
248[label="zx310",fontsize=16,color="green",shape="box"];169[label="numericEnumFromTo zx300 zx310",fontsize=16,color="black",shape="box"];169 -> 188[label="",style="solid", color="black", weight=3];
249[label="toEnum zx300 : map toEnum zx301",fontsize=16,color="green",shape="box"];249 -> 277[label="",style="dashed", color="green", weight=3];
249 -> 278[label="",style="dashed", color="green", weight=3];
250[label="[]",fontsize=16,color="green",shape="box"];1382[label="index (zx30,zx31) zx31",fontsize=16,color="black",shape="triangle"];1382 -> 1394[label="",style="solid", color="black", weight=3];
1381[label="zx127 + Pos (Succ Zero)",fontsize=16,color="black",shape="triangle"];1381 -> 1395[label="",style="solid", color="black", weight=3];
101[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) ((<=) zx30 zx31)))",fontsize=16,color="black",shape="box"];101 -> 127[label="",style="solid", color="black", weight=3];
102[label="rangeSize1 zx30 zx31 (null ((++) range40 LT (zx31 >= LT && LT >= zx30) foldr (++) [] (map (range4 zx31 zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];102 -> 128[label="",style="solid", color="black", weight=3];
103[label="rangeSize1 zx30 zx31 (null ((++) range00 False (zx31 >= False && False >= zx30) foldr (++) [] (map (range0 zx31 zx30) (True : []))))",fontsize=16,color="black",shape="box"];103 -> 129[label="",style="solid", color="black", weight=3];
104[label="range (zx300,zx310)\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="triangle"];10877[label="zx300/(zx3000,zx3001,zx3002)",fontsize=10,color="white",style="solid",shape="box"];104 -> 10877[label="",style="solid", color="burlywood", weight=9];
10877 -> 130[label="",style="solid", color="burlywood", weight=3];
105[label="range (zx300,zx310)\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="triangle"];10878[label="zx300/(zx3000,zx3001)",fontsize=10,color="white",style="solid",shape="box"];105 -> 10878[label="",style="solid", color="burlywood", weight=9];
10878 -> 131[label="",style="solid", color="burlywood", weight=3];
106[label="range (zx300,zx310)",fontsize=16,color="black",shape="triangle"];106 -> 132[label="",style="solid", color="black", weight=3];
107[label="range (zx300,zx310)",fontsize=16,color="burlywood",shape="triangle"];10879[label="zx300/()",fontsize=10,color="white",style="solid",shape="box"];107 -> 10879[label="",style="solid", color="burlywood", weight=9];
10879 -> 133[label="",style="solid", color="burlywood", weight=3];
109[label="range (zx300,zx310)",fontsize=16,color="black",shape="triangle"];109 -> 135[label="",style="solid", color="black", weight=3];
110[label="range (zx300,zx310)",fontsize=16,color="black",shape="triangle"];110 -> 136[label="",style="solid", color="black", weight=3];
111[label="range (zx300,zx310)",fontsize=16,color="black",shape="triangle"];111 -> 137[label="",style="solid", color="black", weight=3];
112[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) (null (foldr (++) [] (map (range3 zx14 zx17 zx13 zx16) (zx180 : zx181))))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];112 -> 138[label="",style="solid", color="black", weight=3];
113[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) (null (foldr (++) [] (map (range3 zx14 zx17 zx13 zx16) [])))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];113 -> 139[label="",style="solid", color="black", weight=3];
114 -> 104[label="",style="dashed", color="red", weight=0];
114[label="range (zx300,zx310)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];114 -> 140[label="",style="dashed", color="magenta", weight=3];
114 -> 141[label="",style="dashed", color="magenta", weight=3];
115 -> 105[label="",style="dashed", color="red", weight=0];
115[label="range (zx300,zx310)\n  Ix a  Ix b",fontsize=16,color="magenta"];115 -> 142[label="",style="dashed", color="magenta", weight=3];
115 -> 143[label="",style="dashed", color="magenta", weight=3];
116 -> 106[label="",style="dashed", color="red", weight=0];
116[label="range (zx300,zx310)",fontsize=16,color="magenta"];116 -> 144[label="",style="dashed", color="magenta", weight=3];
116 -> 145[label="",style="dashed", color="magenta", weight=3];
117 -> 107[label="",style="dashed", color="red", weight=0];
117[label="range (zx300,zx310)",fontsize=16,color="magenta"];117 -> 146[label="",style="dashed", color="magenta", weight=3];
117 -> 147[label="",style="dashed", color="magenta", weight=3];
118 -> 108[label="",style="dashed", color="red", weight=0];
118[label="range (zx300,zx310)",fontsize=16,color="magenta"];118 -> 148[label="",style="dashed", color="magenta", weight=3];
118 -> 149[label="",style="dashed", color="magenta", weight=3];
119 -> 109[label="",style="dashed", color="red", weight=0];
119[label="range (zx300,zx310)",fontsize=16,color="magenta"];119 -> 150[label="",style="dashed", color="magenta", weight=3];
119 -> 151[label="",style="dashed", color="magenta", weight=3];
120 -> 110[label="",style="dashed", color="red", weight=0];
120[label="range (zx300,zx310)",fontsize=16,color="magenta"];120 -> 152[label="",style="dashed", color="magenta", weight=3];
120 -> 153[label="",style="dashed", color="magenta", weight=3];
121 -> 111[label="",style="dashed", color="red", weight=0];
121[label="range (zx300,zx310)",fontsize=16,color="magenta"];121 -> 154[label="",style="dashed", color="magenta", weight=3];
121 -> 155[label="",style="dashed", color="magenta", weight=3];
122[label="rangeSize1 (zx25,zx26) (zx27,zx28) (null (foldr (++) [] (map (range6 zx26 zx28) (zx290 : zx291))))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];122 -> 156[label="",style="solid", color="black", weight=3];
123[label="rangeSize1 (zx25,zx26) (zx27,zx28) (null (foldr (++) [] (map (range6 zx26 zx28) [])))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];123 -> 157[label="",style="solid", color="black", weight=3];
124[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) (compare zx30 zx31 /= GT)))",fontsize=16,color="black",shape="box"];124 -> 158[label="",style="solid", color="black", weight=3];
1383[label="index ((),()) ()",fontsize=16,color="black",shape="box"];1383 -> 1396[label="",style="solid", color="black", weight=3];
276[label="primCharToInt (Char zx3000)",fontsize=16,color="black",shape="box"];276 -> 313[label="",style="solid", color="black", weight=3];
188[label="takeWhile (flip (<=) zx310) (numericEnumFrom zx300)",fontsize=16,color="black",shape="triangle"];188 -> 224[label="",style="solid", color="black", weight=3];
277[label="toEnum zx300",fontsize=16,color="black",shape="box"];277 -> 314[label="",style="solid", color="black", weight=3];
278 -> 186[label="",style="dashed", color="red", weight=0];
278[label="map toEnum zx301",fontsize=16,color="magenta"];278 -> 315[label="",style="dashed", color="magenta", weight=3];
1394[label="index9 (zx30,zx31) zx31",fontsize=16,color="black",shape="box"];1394 -> 1503[label="",style="solid", color="black", weight=3];
1395[label="primPlusInt zx127 (Pos (Succ Zero))",fontsize=16,color="burlywood",shape="triangle"];10889[label="zx127/Pos zx1270",fontsize=10,color="white",style="solid",shape="box"];1395 -> 10889[label="",style="solid", color="burlywood", weight=9];
10889 -> 1504[label="",style="solid", color="burlywood", weight=3];
10890[label="zx127/Neg zx1270",fontsize=10,color="white",style="solid",shape="box"];1395 -> 10890[label="",style="solid", color="burlywood", weight=9];
10890 -> 1505[label="",style="solid", color="burlywood", weight=3];
127[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) (compare zx30 zx31 /= GT)))",fontsize=16,color="black",shape="box"];127 -> 161[label="",style="solid", color="black", weight=3];
128[label="rangeSize1 zx30 zx31 (null ((++) range40 LT (compare zx31 LT /= LT && LT >= zx30) foldr (++) [] (map (range4 zx31 zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];128 -> 162[label="",style="solid", color="black", weight=3];
129[label="rangeSize1 zx30 zx31 (null ((++) range00 False (compare zx31 False /= LT && False >= zx30) foldr (++) [] (map (range0 zx31 zx30) (True : []))))",fontsize=16,color="black",shape="box"];129 -> 163[label="",style="solid", color="black", weight=3];
130[label="range ((zx3000,zx3001,zx3002),zx310)\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="box"];10891[label="zx310/(zx3100,zx3101,zx3102)",fontsize=10,color="white",style="solid",shape="box"];130 -> 10891[label="",style="solid", color="burlywood", weight=9];
10891 -> 164[label="",style="solid", color="burlywood", weight=3];
131[label="range ((zx3000,zx3001),zx310)\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="box"];10892[label="zx310/(zx3100,zx3101)",fontsize=10,color="white",style="solid",shape="box"];131 -> 10892[label="",style="solid", color="burlywood", weight=9];
10892 -> 165[label="",style="solid", color="burlywood", weight=3];
132[label="enumFromTo zx300 zx310",fontsize=16,color="black",shape="box"];132 -> 166[label="",style="solid", color="black", weight=3];
133[label="range ((),zx310)",fontsize=16,color="burlywood",shape="box"];10893[label="zx310/()",fontsize=10,color="white",style="solid",shape="box"];133 -> 10893[label="",style="solid", color="burlywood", weight=9];
10893 -> 167[label="",style="solid", color="burlywood", weight=3];
136[label="concatMap (range4 zx310 zx300) (LT : EQ : GT : [])",fontsize=16,color="black",shape="box"];136 -> 170[label="",style="solid", color="black", weight=3];
137[label="concatMap (range0 zx310 zx300) (False : True : [])",fontsize=16,color="black",shape="box"];137 -> 171[label="",style="solid", color="black", weight=3];
138[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) (null (foldr (++) [] (range3 zx14 zx17 zx13 zx16 zx180 : map (range3 zx14 zx17 zx13 zx16) zx181)))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];138 -> 172[label="",style="solid", color="black", weight=3];
139[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) (null (foldr (++) [] []))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];139 -> 173[label="",style="solid", color="black", weight=3];
140[label="zx300\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];141[label="zx310\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];142[label="zx300\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];143[label="zx310\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];144[label="zx300",fontsize=16,color="green",shape="box"];145[label="zx310",fontsize=16,color="green",shape="box"];146[label="zx300",fontsize=16,color="green",shape="box"];147[label="zx310",fontsize=16,color="green",shape="box"];148[label="zx300",fontsize=16,color="green",shape="box"];149[label="zx310",fontsize=16,color="green",shape="box"];150[label="zx300",fontsize=16,color="green",shape="box"];151[label="zx310",fontsize=16,color="green",shape="box"];152[label="zx300",fontsize=16,color="green",shape="box"];153[label="zx310",fontsize=16,color="green",shape="box"];154[label="zx300",fontsize=16,color="green",shape="box"];155[label="zx310",fontsize=16,color="green",shape="box"];156[label="rangeSize1 (zx25,zx26) (zx27,zx28) (null (foldr (++) [] (range6 zx26 zx28 zx290 : map (range6 zx26 zx28) zx291)))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];156 -> 174[label="",style="solid", color="black", weight=3];
157[label="rangeSize1 (zx25,zx26) (zx27,zx28) (null (foldr (++) [] []))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];157 -> 175[label="",style="solid", color="black", weight=3];
158[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) (not (compare zx30 zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10894[label="zx30/Integer zx300",fontsize=10,color="white",style="solid",shape="box"];158 -> 10894[label="",style="solid", color="burlywood", weight=9];
10894 -> 176[label="",style="solid", color="burlywood", weight=3];
1396[label="Pos Zero",fontsize=16,color="green",shape="box"];313[label="Pos zx3000",fontsize=16,color="green",shape="box"];224[label="takeWhile (flip (<=) zx310) (zx300 : (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];224 -> 251[label="",style="solid", color="black", weight=3];
314[label="primIntToChar zx300",fontsize=16,color="burlywood",shape="box"];10895[label="zx300/Pos zx3000",fontsize=10,color="white",style="solid",shape="box"];314 -> 10895[label="",style="solid", color="burlywood", weight=9];
10895 -> 322[label="",style="solid", color="burlywood", weight=3];
10896[label="zx300/Neg zx3000",fontsize=10,color="white",style="solid",shape="box"];314 -> 10896[label="",style="solid", color="burlywood", weight=9];
10896 -> 323[label="",style="solid", color="burlywood", weight=3];
315[label="zx301",fontsize=16,color="green",shape="box"];1503[label="index8 zx30 zx31 zx31 (inRange (zx30,zx31) zx31)",fontsize=16,color="black",shape="box"];1503 -> 1619[label="",style="solid", color="black", weight=3];
1504[label="primPlusInt (Pos zx1270) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1504 -> 1620[label="",style="solid", color="black", weight=3];
1505[label="primPlusInt (Neg zx1270) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1505 -> 1621[label="",style="solid", color="black", weight=3];
161[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) (not (compare zx30 zx31 == GT))))",fontsize=16,color="black",shape="box"];161 -> 179[label="",style="solid", color="black", weight=3];
162[label="rangeSize1 zx30 zx31 (null ((++) range40 LT (not (compare zx31 LT == LT) && LT >= zx30) foldr (++) [] (map (range4 zx31 zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];162 -> 180[label="",style="solid", color="black", weight=3];
163[label="rangeSize1 zx30 zx31 (null ((++) range00 False (not (compare zx31 False == LT) && False >= zx30) foldr (++) [] (map (range0 zx31 zx30) (True : []))))",fontsize=16,color="black",shape="box"];163 -> 181[label="",style="solid", color="black", weight=3];
164[label="range ((zx3000,zx3001,zx3002),(zx3100,zx3101,zx3102))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];164 -> 182[label="",style="solid", color="black", weight=3];
165[label="range ((zx3000,zx3001),(zx3100,zx3101))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];165 -> 183[label="",style="solid", color="black", weight=3];
166[label="numericEnumFromTo zx300 zx310",fontsize=16,color="black",shape="box"];166 -> 184[label="",style="solid", color="black", weight=3];
167[label="range ((),())",fontsize=16,color="black",shape="box"];167 -> 185[label="",style="solid", color="black", weight=3];
170[label="concat . map (range4 zx310 zx300)",fontsize=16,color="black",shape="box"];170 -> 189[label="",style="solid", color="black", weight=3];
171[label="concat . map (range0 zx310 zx300)",fontsize=16,color="black",shape="box"];171 -> 190[label="",style="solid", color="black", weight=3];
172 -> 730[label="",style="dashed", color="red", weight=0];
172[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) (null ((++) range3 zx14 zx17 zx13 zx16 zx180 foldr (++) [] (map (range3 zx14 zx17 zx13 zx16) zx181)))\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];172 -> 731[label="",style="dashed", color="magenta", weight=3];
172 -> 732[label="",style="dashed", color="magenta", weight=3];
172 -> 733[label="",style="dashed", color="magenta", weight=3];
172 -> 734[label="",style="dashed", color="magenta", weight=3];
172 -> 735[label="",style="dashed", color="magenta", weight=3];
172 -> 736[label="",style="dashed", color="magenta", weight=3];
172 -> 737[label="",style="dashed", color="magenta", weight=3];
172 -> 738[label="",style="dashed", color="magenta", weight=3];
173[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) (null [])\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];173 -> 192[label="",style="solid", color="black", weight=3];
174 -> 841[label="",style="dashed", color="red", weight=0];
174[label="rangeSize1 (zx25,zx26) (zx27,zx28) (null ((++) range6 zx26 zx28 zx290 foldr (++) [] (map (range6 zx26 zx28) zx291)))\n  Ix a  Ix b",fontsize=16,color="magenta"];174 -> 842[label="",style="dashed", color="magenta", weight=3];
174 -> 843[label="",style="dashed", color="magenta", weight=3];
174 -> 844[label="",style="dashed", color="magenta", weight=3];
174 -> 845[label="",style="dashed", color="magenta", weight=3];
174 -> 846[label="",style="dashed", color="magenta", weight=3];
174 -> 847[label="",style="dashed", color="magenta", weight=3];
175[label="rangeSize1 (zx25,zx26) (zx27,zx28) (null [])\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];175 -> 194[label="",style="solid", color="black", weight=3];
176[label="rangeSize1 (Integer zx300) zx31 (null (takeWhile1 (flip (<=) zx31) (Integer zx300) (numericEnumFrom $! Integer zx300 + fromInt (Pos (Succ Zero))) (not (compare (Integer zx300) zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10899[label="zx31/Integer zx310",fontsize=10,color="white",style="solid",shape="box"];176 -> 10899[label="",style="solid", color="burlywood", weight=9];
10899 -> 195[label="",style="solid", color="burlywood", weight=3];
251[label="takeWhile2 (flip (<=) zx310) (zx300 : (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];251 -> 279[label="",style="solid", color="black", weight=3];
322[label="primIntToChar (Pos zx3000)",fontsize=16,color="black",shape="box"];322 -> 331[label="",style="solid", color="black", weight=3];
323[label="primIntToChar (Neg zx3000)",fontsize=16,color="burlywood",shape="box"];10900[label="zx3000/Succ zx30000",fontsize=10,color="white",style="solid",shape="box"];323 -> 10900[label="",style="solid", color="burlywood", weight=9];
10900 -> 332[label="",style="solid", color="burlywood", weight=3];
10901[label="zx3000/Zero",fontsize=10,color="white",style="solid",shape="box"];323 -> 10901[label="",style="solid", color="burlywood", weight=9];
10901 -> 333[label="",style="solid", color="burlywood", weight=3];
1619 -> 1629[label="",style="dashed", color="red", weight=0];
1619[label="index8 zx30 zx31 zx31 (fromEnum zx30 <= inRangeI zx31 && inRangeI zx31 <= fromEnum zx31)",fontsize=16,color="magenta"];1619 -> 1630[label="",style="dashed", color="magenta", weight=3];
1619 -> 1631[label="",style="dashed", color="magenta", weight=3];
1620[label="Pos (primPlusNat zx1270 (Succ Zero))",fontsize=16,color="green",shape="box"];1620 -> 1632[label="",style="dashed", color="green", weight=3];
1621[label="primMinusNat (Succ Zero) zx1270",fontsize=16,color="burlywood",shape="box"];10903[label="zx1270/Succ zx12700",fontsize=10,color="white",style="solid",shape="box"];1621 -> 10903[label="",style="solid", color="burlywood", weight=9];
10903 -> 1633[label="",style="solid", color="burlywood", weight=3];
10904[label="zx1270/Zero",fontsize=10,color="white",style="solid",shape="box"];1621 -> 10904[label="",style="solid", color="burlywood", weight=9];
10904 -> 1634[label="",style="solid", color="burlywood", weight=3];
179[label="rangeSize1 zx30 zx31 (null (takeWhile1 (flip (<=) zx31) zx30 (numericEnumFrom $! zx30 + fromInt (Pos (Succ Zero))) (not (primCmpInt zx30 zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10905[label="zx30/Pos zx300",fontsize=10,color="white",style="solid",shape="box"];179 -> 10905[label="",style="solid", color="burlywood", weight=9];
10905 -> 213[label="",style="solid", color="burlywood", weight=3];
10906[label="zx30/Neg zx300",fontsize=10,color="white",style="solid",shape="box"];179 -> 10906[label="",style="solid", color="burlywood", weight=9];
10906 -> 214[label="",style="solid", color="burlywood", weight=3];
180[label="rangeSize1 zx30 zx31 (null ((++) range40 LT (not (compare3 zx31 LT == LT) && LT >= zx30) foldr (++) [] (map (range4 zx31 zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];180 -> 215[label="",style="solid", color="black", weight=3];
181[label="rangeSize1 zx30 zx31 (null ((++) range00 False (not (compare3 zx31 False == LT) && False >= zx30) foldr (++) [] (map (range0 zx31 zx30) (True : []))))",fontsize=16,color="black",shape="box"];181 -> 216[label="",style="solid", color="black", weight=3];
182[label="concatMap (range3 zx3002 zx3102 zx3001 zx3101) (range (zx3000,zx3100))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];182 -> 217[label="",style="solid", color="black", weight=3];
183[label="concatMap (range6 zx3001 zx3101) (range (zx3000,zx3100))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];183 -> 218[label="",style="solid", color="black", weight=3];
184[label="takeWhile (flip (<=) zx310) (numericEnumFrom zx300)",fontsize=16,color="black",shape="triangle"];184 -> 219[label="",style="solid", color="black", weight=3];
185[label="() : []",fontsize=16,color="green",shape="box"];189[label="concat (map (range4 zx310 zx300) (LT : EQ : GT : []))",fontsize=16,color="black",shape="box"];189 -> 225[label="",style="solid", color="black", weight=3];
190[label="concat (map (range0 zx310 zx300) (False : True : []))",fontsize=16,color="black",shape="box"];190 -> 226[label="",style="solid", color="black", weight=3];
731 -> 306[label="",style="dashed", color="red", weight=0];
731[label="foldr (++) [] (map (range3 zx14 zx17 zx13 zx16) zx181)\n  Ix a  Ix b",fontsize=16,color="magenta"];731 -> 791[label="",style="dashed", color="magenta", weight=3];
731 -> 792[label="",style="dashed", color="magenta", weight=3];
731 -> 793[label="",style="dashed", color="magenta", weight=3];
731 -> 794[label="",style="dashed", color="magenta", weight=3];
731 -> 795[label="",style="dashed", color="magenta", weight=3];
732[label="zx15\n  Ix a",fontsize=16,color="green",shape="box"];733[label="zx16\n  Ix a",fontsize=16,color="green",shape="box"];734[label="range3 zx14 zx17 zx13 zx16 zx180\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];734 -> 796[label="",style="solid", color="black", weight=3];
735[label="zx14\n  Ix a",fontsize=16,color="green",shape="box"];736[label="zx17\n  Ix a",fontsize=16,color="green",shape="box"];737[label="zx13\n  Ix a",fontsize=16,color="green",shape="box"];738[label="zx12\n  Ix a",fontsize=16,color="green",shape="box"];730[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) (null ((++) zx90 zx70))\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="triangle"];10908[label="zx90/zx900 : zx901",fontsize=10,color="white",style="solid",shape="box"];730 -> 10908[label="",style="solid", color="burlywood", weight=9];
10908 -> 797[label="",style="solid", color="burlywood", weight=3];
10909[label="zx90/[]",fontsize=10,color="white",style="solid",shape="box"];730 -> 10909[label="",style="solid", color="burlywood", weight=9];
10909 -> 798[label="",style="solid", color="burlywood", weight=3];
192[label="rangeSize1 (zx12,zx13,zx14) (zx15,zx16,zx17) True\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="triangle"];192 -> 228[label="",style="solid", color="black", weight=3];
842[label="zx27\n  Ix a",fontsize=16,color="green",shape="box"];843 -> 317[label="",style="dashed", color="red", weight=0];
843[label="foldr (++) [] (map (range6 zx26 zx28) zx291)\n  Ix a",fontsize=16,color="magenta"];843 -> 888[label="",style="dashed", color="magenta", weight=3];
843 -> 889[label="",style="dashed", color="magenta", weight=3];
843 -> 890[label="",style="dashed", color="magenta", weight=3];
844[label="zx25\n  Ix a",fontsize=16,color="green",shape="box"];845[label="range6 zx26 zx28 zx290\n  Ix a",fontsize=16,color="black",shape="box"];845 -> 891[label="",style="solid", color="black", weight=3];
846[label="zx26\n  Ix a",fontsize=16,color="green",shape="box"];847[label="zx28\n  Ix a",fontsize=16,color="green",shape="box"];841[label="rangeSize1 (zx81,zx82) (zx83,zx84) (null ((++) zx95 zx87))\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="triangle"];10911[label="zx95/zx950 : zx951",fontsize=10,color="white",style="solid",shape="box"];841 -> 10911[label="",style="solid", color="burlywood", weight=9];
10911 -> 892[label="",style="solid", color="burlywood", weight=3];
10912[label="zx95/[]",fontsize=10,color="white",style="solid",shape="box"];841 -> 10912[label="",style="solid", color="burlywood", weight=9];
10912 -> 893[label="",style="solid", color="burlywood", weight=3];
194[label="rangeSize1 (zx25,zx26) (zx27,zx28) True\n  Ix a  Ix b",fontsize=16,color="black",shape="triangle"];194 -> 230[label="",style="solid", color="black", weight=3];
195[label="rangeSize1 (Integer zx300) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer zx300) (numericEnumFrom $! Integer zx300 + fromInt (Pos (Succ Zero))) (not (compare (Integer zx300) (Integer zx310) == GT))))",fontsize=16,color="black",shape="box"];195 -> 231[label="",style="solid", color="black", weight=3];
279[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) (flip (<=) zx310 zx300)",fontsize=16,color="black",shape="box"];279 -> 316[label="",style="solid", color="black", weight=3];
331[label="Char zx3000",fontsize=16,color="green",shape="box"];332[label="primIntToChar (Neg (Succ zx30000))",fontsize=16,color="black",shape="box"];332 -> 338[label="",style="solid", color="black", weight=3];
333[label="primIntToChar (Neg Zero)",fontsize=16,color="black",shape="box"];333 -> 339[label="",style="solid", color="black", weight=3];
1630 -> 220[label="",style="dashed", color="red", weight=0];
1630[label="fromEnum zx31",fontsize=16,color="magenta"];1630 -> 1635[label="",style="dashed", color="magenta", weight=3];
1631 -> 220[label="",style="dashed", color="red", weight=0];
1631[label="fromEnum zx30",fontsize=16,color="magenta"];1631 -> 1636[label="",style="dashed", color="magenta", weight=3];
1629[label="index8 zx30 zx31 zx31 (zx130 <= inRangeI zx31 && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="triangle"];1629 -> 1637[label="",style="solid", color="black", weight=3];
1632 -> 3908[label="",style="dashed", color="red", weight=0];
1632[label="primPlusNat zx1270 (Succ Zero)",fontsize=16,color="magenta"];1632 -> 3909[label="",style="dashed", color="magenta", weight=3];
1632 -> 3910[label="",style="dashed", color="magenta", weight=3];
1633[label="primMinusNat (Succ Zero) (Succ zx12700)",fontsize=16,color="black",shape="box"];1633 -> 1658[label="",style="solid", color="black", weight=3];
1634[label="primMinusNat (Succ Zero) Zero",fontsize=16,color="black",shape="box"];1634 -> 1659[label="",style="solid", color="black", weight=3];
213[label="rangeSize1 (Pos zx300) zx31 (null (takeWhile1 (flip (<=) zx31) (Pos zx300) (numericEnumFrom $! Pos zx300 + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos zx300) zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10916[label="zx300/Succ zx3000",fontsize=10,color="white",style="solid",shape="box"];213 -> 10916[label="",style="solid", color="burlywood", weight=9];
10916 -> 235[label="",style="solid", color="burlywood", weight=3];
10917[label="zx300/Zero",fontsize=10,color="white",style="solid",shape="box"];213 -> 10917[label="",style="solid", color="burlywood", weight=9];
10917 -> 236[label="",style="solid", color="burlywood", weight=3];
214[label="rangeSize1 (Neg zx300) zx31 (null (takeWhile1 (flip (<=) zx31) (Neg zx300) (numericEnumFrom $! Neg zx300 + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg zx300) zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10918[label="zx300/Succ zx3000",fontsize=10,color="white",style="solid",shape="box"];214 -> 10918[label="",style="solid", color="burlywood", weight=9];
10918 -> 237[label="",style="solid", color="burlywood", weight=3];
10919[label="zx300/Zero",fontsize=10,color="white",style="solid",shape="box"];214 -> 10919[label="",style="solid", color="burlywood", weight=9];
10919 -> 238[label="",style="solid", color="burlywood", weight=3];
215[label="rangeSize1 zx30 zx31 (null ((++) range40 LT (not (compare2 zx31 LT (zx31 == LT) == LT) && LT >= zx30) foldr (++) [] (map (range4 zx31 zx30) (EQ : GT : []))))",fontsize=16,color="burlywood",shape="box"];10920[label="zx31/LT",fontsize=10,color="white",style="solid",shape="box"];215 -> 10920[label="",style="solid", color="burlywood", weight=9];
10920 -> 239[label="",style="solid", color="burlywood", weight=3];
10921[label="zx31/EQ",fontsize=10,color="white",style="solid",shape="box"];215 -> 10921[label="",style="solid", color="burlywood", weight=9];
10921 -> 240[label="",style="solid", color="burlywood", weight=3];
10922[label="zx31/GT",fontsize=10,color="white",style="solid",shape="box"];215 -> 10922[label="",style="solid", color="burlywood", weight=9];
10922 -> 241[label="",style="solid", color="burlywood", weight=3];
216[label="rangeSize1 zx30 zx31 (null ((++) range00 False (not (compare2 zx31 False (zx31 == False) == LT) && False >= zx30) foldr (++) [] (map (range0 zx31 zx30) (True : []))))",fontsize=16,color="burlywood",shape="box"];10923[label="zx31/False",fontsize=10,color="white",style="solid",shape="box"];216 -> 10923[label="",style="solid", color="burlywood", weight=9];
10923 -> 242[label="",style="solid", color="burlywood", weight=3];
10924[label="zx31/True",fontsize=10,color="white",style="solid",shape="box"];216 -> 10924[label="",style="solid", color="burlywood", weight=9];
10924 -> 243[label="",style="solid", color="burlywood", weight=3];
217[label="concat . map (range3 zx3002 zx3102 zx3001 zx3101)\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];217 -> 244[label="",style="solid", color="black", weight=3];
218[label="concat . map (range6 zx3001 zx3101)\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];218 -> 245[label="",style="solid", color="black", weight=3];
219[label="takeWhile (flip (<=) zx310) (zx300 : (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];219 -> 246[label="",style="solid", color="black", weight=3];
225[label="foldr (++) [] (map (range4 zx310 zx300) (LT : EQ : GT : []))",fontsize=16,color="black",shape="box"];225 -> 252[label="",style="solid", color="black", weight=3];
226[label="foldr (++) [] (map (range0 zx310 zx300) (False : True : []))",fontsize=16,color="black",shape="box"];226 -> 253[label="",style="solid", color="black", weight=3];
791[label="zx181",fontsize=16,color="green",shape="box"];792[label="zx16\n  Ix a",fontsize=16,color="green",shape="box"];793[label="zx17\n  Ix a",fontsize=16,color="green",shape="box"];794[label="zx14\n  Ix a",fontsize=16,color="green",shape="box"];795[label="zx13\n  Ix a",fontsize=16,color="green",shape="box"];306[label="foldr (++) [] (map (range3 zx38 zx39 zx40 zx41) zx42)",fontsize=16,color="burlywood",shape="triangle"];10925[label="zx42/zx420 : zx421",fontsize=10,color="white",style="solid",shape="box"];306 -> 10925[label="",style="solid", color="burlywood", weight=9];
10925 -> 376[label="",style="solid", color="burlywood", weight=3];
10926[label="zx42/[]",fontsize=10,color="white",style="solid",shape="box"];306 -> 10926[label="",style="solid", color="burlywood", weight=9];
10926 -> 377[label="",style="solid", color="burlywood", weight=3];
796[label="range30 zx14 zx17 zx13 zx16 zx180\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];796 -> 801[label="",style="solid", color="black", weight=3];
797[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) (null ((++) (zx900 : zx901) zx70))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];797 -> 802[label="",style="solid", color="black", weight=3];
798[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) (null ((++) [] zx70))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];798 -> 803[label="",style="solid", color="black", weight=3];
228[label="Pos Zero",fontsize=16,color="green",shape="box"];888[label="zx291",fontsize=16,color="green",shape="box"];889[label="zx28\n  Ix a",fontsize=16,color="green",shape="box"];890[label="zx26\n  Ix a",fontsize=16,color="green",shape="box"];317[label="foldr (++) [] (map (range6 zx47 zx48) zx49)",fontsize=16,color="burlywood",shape="triangle"];10927[label="zx49/zx490 : zx491",fontsize=10,color="white",style="solid",shape="box"];317 -> 10927[label="",style="solid", color="burlywood", weight=9];
10927 -> 386[label="",style="solid", color="burlywood", weight=3];
10928[label="zx49/[]",fontsize=10,color="white",style="solid",shape="box"];317 -> 10928[label="",style="solid", color="burlywood", weight=9];
10928 -> 387[label="",style="solid", color="burlywood", weight=3];
891[label="range60 zx26 zx28 zx290\n  Ix a",fontsize=16,color="black",shape="box"];891 -> 899[label="",style="solid", color="black", weight=3];
892[label="rangeSize1 (zx81,zx82) (zx83,zx84) (null ((++) (zx950 : zx951) zx87))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];892 -> 900[label="",style="solid", color="black", weight=3];
893[label="rangeSize1 (zx81,zx82) (zx83,zx84) (null ((++) [] zx87))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];893 -> 901[label="",style="solid", color="black", weight=3];
230[label="Pos Zero",fontsize=16,color="green",shape="box"];231[label="rangeSize1 (Integer zx300) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer zx300) (numericEnumFrom $! Integer zx300 + fromInt (Pos (Succ Zero))) (not (primCmpInt zx300 zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10929[label="zx300/Pos zx3000",fontsize=10,color="white",style="solid",shape="box"];231 -> 10929[label="",style="solid", color="burlywood", weight=9];
10929 -> 256[label="",style="solid", color="burlywood", weight=3];
10930[label="zx300/Neg zx3000",fontsize=10,color="white",style="solid",shape="box"];231 -> 10930[label="",style="solid", color="burlywood", weight=9];
10930 -> 257[label="",style="solid", color="burlywood", weight=3];
316[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) ((<=) zx300 zx310)",fontsize=16,color="black",shape="box"];316 -> 324[label="",style="solid", color="black", weight=3];
338[label="error []",fontsize=16,color="red",shape="box"];339[label="Char Zero",fontsize=16,color="green",shape="box"];1635[label="zx31",fontsize=16,color="green",shape="box"];1636[label="zx30",fontsize=16,color="green",shape="box"];1637[label="index8 zx30 zx31 zx31 (compare zx130 (inRangeI zx31) /= GT && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];1637 -> 1660[label="",style="solid", color="black", weight=3];
3909[label="Zero",fontsize=16,color="green",shape="box"];3910[label="zx1270",fontsize=16,color="green",shape="box"];3908[label="primPlusNat zx245 (Succ zx15300)",fontsize=16,color="burlywood",shape="triangle"];10931[label="zx245/Succ zx2450",fontsize=10,color="white",style="solid",shape="box"];3908 -> 10931[label="",style="solid", color="burlywood", weight=9];
10931 -> 3920[label="",style="solid", color="burlywood", weight=3];
10932[label="zx245/Zero",fontsize=10,color="white",style="solid",shape="box"];3908 -> 10932[label="",style="solid", color="burlywood", weight=9];
10932 -> 3921[label="",style="solid", color="burlywood", weight=3];
1658[label="primMinusNat Zero zx12700",fontsize=16,color="burlywood",shape="triangle"];10933[label="zx12700/Succ zx127000",fontsize=10,color="white",style="solid",shape="box"];1658 -> 10933[label="",style="solid", color="burlywood", weight=9];
10933 -> 1813[label="",style="solid", color="burlywood", weight=3];
10934[label="zx12700/Zero",fontsize=10,color="white",style="solid",shape="box"];1658 -> 10934[label="",style="solid", color="burlywood", weight=9];
10934 -> 1814[label="",style="solid", color="burlywood", weight=3];
1659[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];235[label="rangeSize1 (Pos (Succ zx3000)) zx31 (null (takeWhile1 (flip (<=) zx31) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx3000)) zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10935[label="zx31/Pos zx310",fontsize=10,color="white",style="solid",shape="box"];235 -> 10935[label="",style="solid", color="burlywood", weight=9];
10935 -> 260[label="",style="solid", color="burlywood", weight=3];
10936[label="zx31/Neg zx310",fontsize=10,color="white",style="solid",shape="box"];235 -> 10936[label="",style="solid", color="burlywood", weight=9];
10936 -> 261[label="",style="solid", color="burlywood", weight=3];
236[label="rangeSize1 (Pos Zero) zx31 (null (takeWhile1 (flip (<=) zx31) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10937[label="zx31/Pos zx310",fontsize=10,color="white",style="solid",shape="box"];236 -> 10937[label="",style="solid", color="burlywood", weight=9];
10937 -> 262[label="",style="solid", color="burlywood", weight=3];
10938[label="zx31/Neg zx310",fontsize=10,color="white",style="solid",shape="box"];236 -> 10938[label="",style="solid", color="burlywood", weight=9];
10938 -> 263[label="",style="solid", color="burlywood", weight=3];
237[label="rangeSize1 (Neg (Succ zx3000)) zx31 (null (takeWhile1 (flip (<=) zx31) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx3000)) zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10939[label="zx31/Pos zx310",fontsize=10,color="white",style="solid",shape="box"];237 -> 10939[label="",style="solid", color="burlywood", weight=9];
10939 -> 264[label="",style="solid", color="burlywood", weight=3];
10940[label="zx31/Neg zx310",fontsize=10,color="white",style="solid",shape="box"];237 -> 10940[label="",style="solid", color="burlywood", weight=9];
10940 -> 265[label="",style="solid", color="burlywood", weight=3];
238[label="rangeSize1 (Neg Zero) zx31 (null (takeWhile1 (flip (<=) zx31) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) zx31 == GT))))",fontsize=16,color="burlywood",shape="box"];10941[label="zx31/Pos zx310",fontsize=10,color="white",style="solid",shape="box"];238 -> 10941[label="",style="solid", color="burlywood", weight=9];
10941 -> 266[label="",style="solid", color="burlywood", weight=3];
10942[label="zx31/Neg zx310",fontsize=10,color="white",style="solid",shape="box"];238 -> 10942[label="",style="solid", color="burlywood", weight=9];
10942 -> 267[label="",style="solid", color="burlywood", weight=3];
239[label="rangeSize1 zx30 LT (null ((++) range40 LT (not (compare2 LT LT (LT == LT) == LT) && LT >= zx30) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];239 -> 268[label="",style="solid", color="black", weight=3];
240[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare2 EQ LT (EQ == LT) == LT) && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];240 -> 269[label="",style="solid", color="black", weight=3];
241[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare2 GT LT (GT == LT) == LT) && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];241 -> 270[label="",style="solid", color="black", weight=3];
242[label="rangeSize1 zx30 False (null ((++) range00 False (not (compare2 False False (False == False) == LT) && False >= zx30) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];242 -> 271[label="",style="solid", color="black", weight=3];
243[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare2 True False (True == False) == LT) && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];243 -> 272[label="",style="solid", color="black", weight=3];
244[label="concat (map (range3 zx3002 zx3102 zx3001 zx3101) (range (zx3000,zx3100)))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];244 -> 273[label="",style="solid", color="black", weight=3];
245[label="concat (map (range6 zx3001 zx3101) (range (zx3000,zx3100)))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];245 -> 274[label="",style="solid", color="black", weight=3];
246[label="takeWhile2 (flip (<=) zx310) (zx300 : (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];246 -> 275[label="",style="solid", color="black", weight=3];
252[label="foldr (++) [] (range4 zx310 zx300 LT : map (range4 zx310 zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];252 -> 280[label="",style="solid", color="black", weight=3];
253[label="foldr (++) [] (range0 zx310 zx300 False : map (range0 zx310 zx300) (True : []))",fontsize=16,color="black",shape="box"];253 -> 281[label="",style="solid", color="black", weight=3];
376[label="foldr (++) [] (map (range3 zx38 zx39 zx40 zx41) (zx420 : zx421))",fontsize=16,color="black",shape="box"];376 -> 451[label="",style="solid", color="black", weight=3];
377[label="foldr (++) [] (map (range3 zx38 zx39 zx40 zx41) [])",fontsize=16,color="black",shape="box"];377 -> 452[label="",style="solid", color="black", weight=3];
801[label="concatMap (range2 zx180 zx14 zx17) (range (zx13,zx16))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];801 -> 807[label="",style="solid", color="black", weight=3];
802[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) (null (zx900 : zx901 ++ zx70))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];802 -> 808[label="",style="solid", color="black", weight=3];
803[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) (null zx70)\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="box"];10943[label="zx70/zx700 : zx701",fontsize=10,color="white",style="solid",shape="box"];803 -> 10943[label="",style="solid", color="burlywood", weight=9];
10943 -> 809[label="",style="solid", color="burlywood", weight=3];
10944[label="zx70/[]",fontsize=10,color="white",style="solid",shape="box"];803 -> 10944[label="",style="solid", color="burlywood", weight=9];
10944 -> 810[label="",style="solid", color="burlywood", weight=3];
386[label="foldr (++) [] (map (range6 zx47 zx48) (zx490 : zx491))",fontsize=16,color="black",shape="box"];386 -> 469[label="",style="solid", color="black", weight=3];
387[label="foldr (++) [] (map (range6 zx47 zx48) [])",fontsize=16,color="black",shape="box"];387 -> 470[label="",style="solid", color="black", weight=3];
899[label="concatMap (range5 zx290) (range (zx26,zx28))\n  Ix a",fontsize=16,color="black",shape="box"];899 -> 995[label="",style="solid", color="black", weight=3];
900[label="rangeSize1 (zx81,zx82) (zx83,zx84) (null (zx950 : zx951 ++ zx87))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];900 -> 996[label="",style="solid", color="black", weight=3];
901[label="rangeSize1 (zx81,zx82) (zx83,zx84) (null zx87)\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="box"];10945[label="zx87/zx870 : zx871",fontsize=10,color="white",style="solid",shape="box"];901 -> 10945[label="",style="solid", color="burlywood", weight=9];
10945 -> 997[label="",style="solid", color="burlywood", weight=3];
10946[label="zx87/[]",fontsize=10,color="white",style="solid",shape="box"];901 -> 10946[label="",style="solid", color="burlywood", weight=9];
10946 -> 998[label="",style="solid", color="burlywood", weight=3];
256[label="rangeSize1 (Integer (Pos zx3000)) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer (Pos zx3000)) (numericEnumFrom $! Integer (Pos zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos zx3000) zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10947[label="zx3000/Succ zx30000",fontsize=10,color="white",style="solid",shape="box"];256 -> 10947[label="",style="solid", color="burlywood", weight=9];
10947 -> 284[label="",style="solid", color="burlywood", weight=3];
10948[label="zx3000/Zero",fontsize=10,color="white",style="solid",shape="box"];256 -> 10948[label="",style="solid", color="burlywood", weight=9];
10948 -> 285[label="",style="solid", color="burlywood", weight=3];
257[label="rangeSize1 (Integer (Neg zx3000)) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer (Neg zx3000)) (numericEnumFrom $! Integer (Neg zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg zx3000) zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10949[label="zx3000/Succ zx30000",fontsize=10,color="white",style="solid",shape="box"];257 -> 10949[label="",style="solid", color="burlywood", weight=9];
10949 -> 286[label="",style="solid", color="burlywood", weight=3];
10950[label="zx3000/Zero",fontsize=10,color="white",style="solid",shape="box"];257 -> 10950[label="",style="solid", color="burlywood", weight=9];
10950 -> 287[label="",style="solid", color="burlywood", weight=3];
324[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) (compare zx300 zx310 /= GT)",fontsize=16,color="black",shape="box"];324 -> 334[label="",style="solid", color="black", weight=3];
1660[label="index8 zx30 zx31 zx31 (not (compare zx130 (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];1660 -> 1815[label="",style="solid", color="black", weight=3];
3920[label="primPlusNat (Succ zx2450) (Succ zx15300)",fontsize=16,color="black",shape="box"];3920 -> 3956[label="",style="solid", color="black", weight=3];
3921[label="primPlusNat Zero (Succ zx15300)",fontsize=16,color="black",shape="box"];3921 -> 3957[label="",style="solid", color="black", weight=3];
1813[label="primMinusNat Zero (Succ zx127000)",fontsize=16,color="black",shape="box"];1813 -> 1933[label="",style="solid", color="black", weight=3];
1814[label="primMinusNat Zero Zero",fontsize=16,color="black",shape="box"];1814 -> 1934[label="",style="solid", color="black", weight=3];
260[label="rangeSize1 (Pos (Succ zx3000)) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx3000)) (Pos zx310) == GT))))",fontsize=16,color="black",shape="box"];260 -> 289[label="",style="solid", color="black", weight=3];
261[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx3000)) (Neg zx310) == GT))))",fontsize=16,color="black",shape="box"];261 -> 290[label="",style="solid", color="black", weight=3];
262[label="rangeSize1 (Pos Zero) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos zx310) == GT))))",fontsize=16,color="burlywood",shape="box"];10951[label="zx310/Succ zx3100",fontsize=10,color="white",style="solid",shape="box"];262 -> 10951[label="",style="solid", color="burlywood", weight=9];
10951 -> 291[label="",style="solid", color="burlywood", weight=3];
10952[label="zx310/Zero",fontsize=10,color="white",style="solid",shape="box"];262 -> 10952[label="",style="solid", color="burlywood", weight=9];
10952 -> 292[label="",style="solid", color="burlywood", weight=3];
263[label="rangeSize1 (Pos Zero) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg zx310) == GT))))",fontsize=16,color="burlywood",shape="box"];10953[label="zx310/Succ zx3100",fontsize=10,color="white",style="solid",shape="box"];263 -> 10953[label="",style="solid", color="burlywood", weight=9];
10953 -> 293[label="",style="solid", color="burlywood", weight=3];
10954[label="zx310/Zero",fontsize=10,color="white",style="solid",shape="box"];263 -> 10954[label="",style="solid", color="burlywood", weight=9];
10954 -> 294[label="",style="solid", color="burlywood", weight=3];
264[label="rangeSize1 (Neg (Succ zx3000)) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx3000)) (Pos zx310) == GT))))",fontsize=16,color="black",shape="box"];264 -> 295[label="",style="solid", color="black", weight=3];
265[label="rangeSize1 (Neg (Succ zx3000)) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx3000)) (Neg zx310) == GT))))",fontsize=16,color="black",shape="box"];265 -> 296[label="",style="solid", color="black", weight=3];
266[label="rangeSize1 (Neg Zero) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos zx310) == GT))))",fontsize=16,color="burlywood",shape="box"];10955[label="zx310/Succ zx3100",fontsize=10,color="white",style="solid",shape="box"];266 -> 10955[label="",style="solid", color="burlywood", weight=9];
10955 -> 297[label="",style="solid", color="burlywood", weight=3];
10956[label="zx310/Zero",fontsize=10,color="white",style="solid",shape="box"];266 -> 10956[label="",style="solid", color="burlywood", weight=9];
10956 -> 298[label="",style="solid", color="burlywood", weight=3];
267[label="rangeSize1 (Neg Zero) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg zx310) == GT))))",fontsize=16,color="burlywood",shape="box"];10957[label="zx310/Succ zx3100",fontsize=10,color="white",style="solid",shape="box"];267 -> 10957[label="",style="solid", color="burlywood", weight=9];
10957 -> 299[label="",style="solid", color="burlywood", weight=3];
10958[label="zx310/Zero",fontsize=10,color="white",style="solid",shape="box"];267 -> 10958[label="",style="solid", color="burlywood", weight=9];
10958 -> 300[label="",style="solid", color="burlywood", weight=3];
268[label="rangeSize1 zx30 LT (null ((++) range40 LT (not (compare2 LT LT True == LT) && LT >= zx30) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];268 -> 301[label="",style="solid", color="black", weight=3];
269[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare2 EQ LT False == LT) && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];269 -> 302[label="",style="solid", color="black", weight=3];
270[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare2 GT LT False == LT) && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];270 -> 303[label="",style="solid", color="black", weight=3];
271[label="rangeSize1 zx30 False (null ((++) range00 False (not (compare2 False False True == LT) && False >= zx30) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];271 -> 304[label="",style="solid", color="black", weight=3];
272[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare2 True False False == LT) && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];272 -> 305[label="",style="solid", color="black", weight=3];
273 -> 306[label="",style="dashed", color="red", weight=0];
273[label="foldr (++) [] (map (range3 zx3002 zx3102 zx3001 zx3101) (range (zx3000,zx3100)))\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];273 -> 307[label="",style="dashed", color="magenta", weight=3];
273 -> 308[label="",style="dashed", color="magenta", weight=3];
273 -> 309[label="",style="dashed", color="magenta", weight=3];
273 -> 310[label="",style="dashed", color="magenta", weight=3];
273 -> 311[label="",style="dashed", color="magenta", weight=3];
274 -> 317[label="",style="dashed", color="red", weight=0];
274[label="foldr (++) [] (map (range6 zx3001 zx3101) (range (zx3000,zx3100)))\n  Ix a  Ix b",fontsize=16,color="magenta"];274 -> 318[label="",style="dashed", color="magenta", weight=3];
274 -> 319[label="",style="dashed", color="magenta", weight=3];
274 -> 320[label="",style="dashed", color="magenta", weight=3];
275[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) (flip (<=) zx310 zx300)",fontsize=16,color="black",shape="box"];275 -> 325[label="",style="solid", color="black", weight=3];
280[label="(++) range4 zx310 zx300 LT foldr (++) [] (map (range4 zx310 zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];280 -> 326[label="",style="solid", color="black", weight=3];
281[label="(++) range0 zx310 zx300 False foldr (++) [] (map (range0 zx310 zx300) (True : []))",fontsize=16,color="black",shape="box"];281 -> 327[label="",style="solid", color="black", weight=3];
451[label="foldr (++) [] (range3 zx38 zx39 zx40 zx41 zx420 : map (range3 zx38 zx39 zx40 zx41) zx421)",fontsize=16,color="black",shape="box"];451 -> 538[label="",style="solid", color="black", weight=3];
452[label="foldr (++) [] []",fontsize=16,color="black",shape="triangle"];452 -> 539[label="",style="solid", color="black", weight=3];
807[label="concat . map (range2 zx180 zx14 zx17)\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];807 -> 813[label="",style="solid", color="black", weight=3];
808[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) False\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="triangle"];808 -> 814[label="",style="solid", color="black", weight=3];
809[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) (null (zx700 : zx701))\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];809 -> 815[label="",style="solid", color="black", weight=3];
810[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) (null [])\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];810 -> 816[label="",style="solid", color="black", weight=3];
469[label="foldr (++) [] (range6 zx47 zx48 zx490 : map (range6 zx47 zx48) zx491)",fontsize=16,color="black",shape="box"];469 -> 540[label="",style="solid", color="black", weight=3];
470[label="foldr (++) [] []",fontsize=16,color="black",shape="triangle"];470 -> 541[label="",style="solid", color="black", weight=3];
995[label="concat . map (range5 zx290)\n  Ix a",fontsize=16,color="black",shape="box"];995 -> 1108[label="",style="solid", color="black", weight=3];
996[label="rangeSize1 (zx81,zx82) (zx83,zx84) False\n  Ix a  Ix b",fontsize=16,color="black",shape="triangle"];996 -> 1109[label="",style="solid", color="black", weight=3];
997[label="rangeSize1 (zx81,zx82) (zx83,zx84) (null (zx870 : zx871))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];997 -> 1110[label="",style="solid", color="black", weight=3];
998[label="rangeSize1 (zx81,zx82) (zx83,zx84) (null [])\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];998 -> 1111[label="",style="solid", color="black", weight=3];
284[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx30000)) zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10961[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];284 -> 10961[label="",style="solid", color="burlywood", weight=9];
10961 -> 340[label="",style="solid", color="burlywood", weight=3];
10962[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];284 -> 10962[label="",style="solid", color="burlywood", weight=9];
10962 -> 341[label="",style="solid", color="burlywood", weight=3];
285[label="rangeSize1 (Integer (Pos Zero)) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10963[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];285 -> 10963[label="",style="solid", color="burlywood", weight=9];
10963 -> 342[label="",style="solid", color="burlywood", weight=3];
10964[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];285 -> 10964[label="",style="solid", color="burlywood", weight=9];
10964 -> 343[label="",style="solid", color="burlywood", weight=3];
286[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx30000)) zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10965[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];286 -> 10965[label="",style="solid", color="burlywood", weight=9];
10965 -> 344[label="",style="solid", color="burlywood", weight=3];
10966[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];286 -> 10966[label="",style="solid", color="burlywood", weight=9];
10966 -> 345[label="",style="solid", color="burlywood", weight=3];
287[label="rangeSize1 (Integer (Neg Zero)) (Integer zx310) (null (takeWhile1 (flip (<=) (Integer zx310)) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10967[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];287 -> 10967[label="",style="solid", color="burlywood", weight=9];
10967 -> 346[label="",style="solid", color="burlywood", weight=3];
10968[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];287 -> 10968[label="",style="solid", color="burlywood", weight=9];
10968 -> 347[label="",style="solid", color="burlywood", weight=3];
334[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) (not (compare zx300 zx310 == GT))",fontsize=16,color="black",shape="box"];334 -> 348[label="",style="solid", color="black", weight=3];
1815[label="index8 zx30 zx31 zx31 (not (primCmpInt zx130 (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];10969[label="zx130/Pos zx1300",fontsize=10,color="white",style="solid",shape="box"];1815 -> 10969[label="",style="solid", color="burlywood", weight=9];
10969 -> 1935[label="",style="solid", color="burlywood", weight=3];
10970[label="zx130/Neg zx1300",fontsize=10,color="white",style="solid",shape="box"];1815 -> 10970[label="",style="solid", color="burlywood", weight=9];
10970 -> 1936[label="",style="solid", color="burlywood", weight=3];
3956[label="Succ (Succ (primPlusNat zx2450 zx15300))",fontsize=16,color="green",shape="box"];3956 -> 4010[label="",style="dashed", color="green", weight=3];
3957[label="Succ zx15300",fontsize=16,color="green",shape="box"];1933[label="Neg (Succ zx127000)",fontsize=16,color="green",shape="box"];1934[label="Pos Zero",fontsize=16,color="green",shape="box"];289[label="rangeSize1 (Pos (Succ zx3000)) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3000) zx310 == GT))))",fontsize=16,color="burlywood",shape="box"];10971[label="zx310/Succ zx3100",fontsize=10,color="white",style="solid",shape="box"];289 -> 10971[label="",style="solid", color="burlywood", weight=9];
10971 -> 349[label="",style="solid", color="burlywood", weight=3];
10972[label="zx310/Zero",fontsize=10,color="white",style="solid",shape="box"];289 -> 10972[label="",style="solid", color="burlywood", weight=9];
10972 -> 350[label="",style="solid", color="burlywood", weight=3];
290[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];290 -> 351[label="",style="solid", color="black", weight=3];
291[label="rangeSize1 (Pos Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ zx3100)) == GT))))",fontsize=16,color="black",shape="box"];291 -> 352[label="",style="solid", color="black", weight=3];
292[label="rangeSize1 (Pos Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))))",fontsize=16,color="black",shape="box"];292 -> 353[label="",style="solid", color="black", weight=3];
293[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg (Succ zx3100)) == GT))))",fontsize=16,color="black",shape="box"];293 -> 354[label="",style="solid", color="black", weight=3];
294[label="rangeSize1 (Pos Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg Zero) == GT))))",fontsize=16,color="black",shape="box"];294 -> 355[label="",style="solid", color="black", weight=3];
295[label="rangeSize1 (Neg (Succ zx3000)) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];295 -> 356[label="",style="solid", color="black", weight=3];
296[label="rangeSize1 (Neg (Succ zx3000)) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx310 (Succ zx3000) == GT))))",fontsize=16,color="burlywood",shape="box"];10973[label="zx310/Succ zx3100",fontsize=10,color="white",style="solid",shape="box"];296 -> 10973[label="",style="solid", color="burlywood", weight=9];
10973 -> 357[label="",style="solid", color="burlywood", weight=3];
10974[label="zx310/Zero",fontsize=10,color="white",style="solid",shape="box"];296 -> 10974[label="",style="solid", color="burlywood", weight=9];
10974 -> 358[label="",style="solid", color="burlywood", weight=3];
297[label="rangeSize1 (Neg Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos (Succ zx3100)) == GT))))",fontsize=16,color="black",shape="box"];297 -> 359[label="",style="solid", color="black", weight=3];
298[label="rangeSize1 (Neg Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos Zero) == GT))))",fontsize=16,color="black",shape="box"];298 -> 360[label="",style="solid", color="black", weight=3];
299[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg (Succ zx3100)) == GT))))",fontsize=16,color="black",shape="box"];299 -> 361[label="",style="solid", color="black", weight=3];
300[label="rangeSize1 (Neg Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))))",fontsize=16,color="black",shape="box"];300 -> 362[label="",style="solid", color="black", weight=3];
301[label="rangeSize1 zx30 LT (null ((++) range40 LT (not (EQ == LT) && LT >= zx30) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];301 -> 363[label="",style="solid", color="black", weight=3];
302[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare1 EQ LT (EQ <= LT) == LT) && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];302 -> 364[label="",style="solid", color="black", weight=3];
303[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare1 GT LT (GT <= LT) == LT) && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];303 -> 365[label="",style="solid", color="black", weight=3];
304[label="rangeSize1 zx30 False (null ((++) range00 False (not (EQ == LT) && False >= zx30) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];304 -> 366[label="",style="solid", color="black", weight=3];
305[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare1 True False (True <= False) == LT) && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];305 -> 367[label="",style="solid", color="black", weight=3];
307[label="range (zx3000,zx3100)\n  Ix a",fontsize=16,color="blue",shape="box"];10975[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];307 -> 10975[label="",style="solid", color="blue", weight=9];
10975 -> 368[label="",style="solid", color="blue", weight=3];
10976[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];307 -> 10976[label="",style="solid", color="blue", weight=9];
10976 -> 369[label="",style="solid", color="blue", weight=3];
10977[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];307 -> 10977[label="",style="solid", color="blue", weight=9];
10977 -> 370[label="",style="solid", color="blue", weight=3];
10978[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];307 -> 10978[label="",style="solid", color="blue", weight=9];
10978 -> 371[label="",style="solid", color="blue", weight=3];
10979[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];307 -> 10979[label="",style="solid", color="blue", weight=9];
10979 -> 372[label="",style="solid", color="blue", weight=3];
10980[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];307 -> 10980[label="",style="solid", color="blue", weight=9];
10980 -> 373[label="",style="solid", color="blue", weight=3];
10981[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];307 -> 10981[label="",style="solid", color="blue", weight=9];
10981 -> 374[label="",style="solid", color="blue", weight=3];
10982[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];307 -> 10982[label="",style="solid", color="blue", weight=9];
10982 -> 375[label="",style="solid", color="blue", weight=3];
308[label="zx3101\n  Ix a",fontsize=16,color="green",shape="box"];309[label="zx3102\n  Ix a",fontsize=16,color="green",shape="box"];310[label="zx3002\n  Ix a",fontsize=16,color="green",shape="box"];311[label="zx3001\n  Ix a",fontsize=16,color="green",shape="box"];318[label="range (zx3000,zx3100)\n  Ix a",fontsize=16,color="blue",shape="box"];10983[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];318 -> 10983[label="",style="solid", color="blue", weight=9];
10983 -> 378[label="",style="solid", color="blue", weight=3];
10984[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];318 -> 10984[label="",style="solid", color="blue", weight=9];
10984 -> 379[label="",style="solid", color="blue", weight=3];
10985[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];318 -> 10985[label="",style="solid", color="blue", weight=9];
10985 -> 380[label="",style="solid", color="blue", weight=3];
10986[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];318 -> 10986[label="",style="solid", color="blue", weight=9];
10986 -> 381[label="",style="solid", color="blue", weight=3];
10987[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];318 -> 10987[label="",style="solid", color="blue", weight=9];
10987 -> 382[label="",style="solid", color="blue", weight=3];
10988[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];318 -> 10988[label="",style="solid", color="blue", weight=9];
10988 -> 383[label="",style="solid", color="blue", weight=3];
10989[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];318 -> 10989[label="",style="solid", color="blue", weight=9];
10989 -> 384[label="",style="solid", color="blue", weight=3];
10990[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];318 -> 10990[label="",style="solid", color="blue", weight=9];
10990 -> 385[label="",style="solid", color="blue", weight=3];
319[label="zx3101\n  Ix a",fontsize=16,color="green",shape="box"];320[label="zx3001\n  Ix a",fontsize=16,color="green",shape="box"];325[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) ((<=) zx300 zx310)",fontsize=16,color="black",shape="box"];325 -> 388[label="",style="solid", color="black", weight=3];
326[label="(++) range40 LT (zx310 >= LT && LT >= zx300) foldr (++) [] (map (range4 zx310 zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];326 -> 389[label="",style="solid", color="black", weight=3];
327[label="(++) range00 False (zx310 >= False && False >= zx300) foldr (++) [] (map (range0 zx310 zx300) (True : []))",fontsize=16,color="black",shape="box"];327 -> 390[label="",style="solid", color="black", weight=3];
538 -> 1115[label="",style="dashed", color="red", weight=0];
538[label="(++) range3 zx38 zx39 zx40 zx41 zx420 foldr (++) [] (map (range3 zx38 zx39 zx40 zx41) zx421)",fontsize=16,color="magenta"];538 -> 1116[label="",style="dashed", color="magenta", weight=3];
538 -> 1117[label="",style="dashed", color="magenta", weight=3];
539[label="[]",fontsize=16,color="green",shape="box"];813[label="concat (map (range2 zx180 zx14 zx17) (range (zx13,zx16)))\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];813 -> 819[label="",style="solid", color="black", weight=3];
814[label="rangeSize0 (zx62,zx63,zx64) (zx65,zx66,zx67) otherwise\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];814 -> 820[label="",style="solid", color="black", weight=3];
815 -> 808[label="",style="dashed", color="red", weight=0];
815[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) False\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];816 -> 192[label="",style="dashed", color="red", weight=0];
816[label="rangeSize1 (zx62,zx63,zx64) (zx65,zx66,zx67) True\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];816 -> 821[label="",style="dashed", color="magenta", weight=3];
816 -> 822[label="",style="dashed", color="magenta", weight=3];
816 -> 823[label="",style="dashed", color="magenta", weight=3];
816 -> 824[label="",style="dashed", color="magenta", weight=3];
816 -> 825[label="",style="dashed", color="magenta", weight=3];
816 -> 826[label="",style="dashed", color="magenta", weight=3];
540 -> 1291[label="",style="dashed", color="red", weight=0];
540[label="(++) range6 zx47 zx48 zx490 foldr (++) [] (map (range6 zx47 zx48) zx491)",fontsize=16,color="magenta"];540 -> 1292[label="",style="dashed", color="magenta", weight=3];
540 -> 1293[label="",style="dashed", color="magenta", weight=3];
541[label="[]",fontsize=16,color="green",shape="box"];1108[label="concat (map (range5 zx290) (range (zx26,zx28)))\n  Ix a",fontsize=16,color="black",shape="box"];1108 -> 1126[label="",style="solid", color="black", weight=3];
1109[label="rangeSize0 (zx81,zx82) (zx83,zx84) otherwise\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];1109 -> 1127[label="",style="solid", color="black", weight=3];
1110 -> 996[label="",style="dashed", color="red", weight=0];
1110[label="rangeSize1 (zx81,zx82) (zx83,zx84) False\n  Ix a  Ix b",fontsize=16,color="magenta"];1111 -> 194[label="",style="dashed", color="red", weight=0];
1111[label="rangeSize1 (zx81,zx82) (zx83,zx84) True\n  Ix a  Ix b",fontsize=16,color="magenta"];1111 -> 1128[label="",style="dashed", color="magenta", weight=3];
1111 -> 1129[label="",style="dashed", color="magenta", weight=3];
1111 -> 1130[label="",style="dashed", color="magenta", weight=3];
1111 -> 1131[label="",style="dashed", color="magenta", weight=3];
340[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx30000)) (Pos zx3100) == GT))))",fontsize=16,color="black",shape="box"];340 -> 402[label="",style="solid", color="black", weight=3];
341[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx30000)) (Neg zx3100) == GT))))",fontsize=16,color="black",shape="box"];341 -> 403[label="",style="solid", color="black", weight=3];
342[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos zx3100) == GT))))",fontsize=16,color="burlywood",shape="box"];10997[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];342 -> 10997[label="",style="solid", color="burlywood", weight=9];
10997 -> 404[label="",style="solid", color="burlywood", weight=3];
10998[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];342 -> 10998[label="",style="solid", color="burlywood", weight=9];
10998 -> 405[label="",style="solid", color="burlywood", weight=3];
343[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg zx3100) == GT))))",fontsize=16,color="burlywood",shape="box"];10999[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];343 -> 10999[label="",style="solid", color="burlywood", weight=9];
10999 -> 406[label="",style="solid", color="burlywood", weight=3];
11000[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];343 -> 11000[label="",style="solid", color="burlywood", weight=9];
11000 -> 407[label="",style="solid", color="burlywood", weight=3];
344[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx30000)) (Pos zx3100) == GT))))",fontsize=16,color="black",shape="box"];344 -> 408[label="",style="solid", color="black", weight=3];
345[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx30000)) (Neg zx3100) == GT))))",fontsize=16,color="black",shape="box"];345 -> 409[label="",style="solid", color="black", weight=3];
346[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos zx3100) == GT))))",fontsize=16,color="burlywood",shape="box"];11001[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];346 -> 11001[label="",style="solid", color="burlywood", weight=9];
11001 -> 410[label="",style="solid", color="burlywood", weight=3];
11002[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];346 -> 11002[label="",style="solid", color="burlywood", weight=9];
11002 -> 411[label="",style="solid", color="burlywood", weight=3];
347[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg zx3100) == GT))))",fontsize=16,color="burlywood",shape="box"];11003[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];347 -> 11003[label="",style="solid", color="burlywood", weight=9];
11003 -> 412[label="",style="solid", color="burlywood", weight=3];
11004[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];347 -> 11004[label="",style="solid", color="burlywood", weight=9];
11004 -> 413[label="",style="solid", color="burlywood", weight=3];
348[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) (not (primCmpInt zx300 zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11005[label="zx300/Pos zx3000",fontsize=10,color="white",style="solid",shape="box"];348 -> 11005[label="",style="solid", color="burlywood", weight=9];
11005 -> 414[label="",style="solid", color="burlywood", weight=3];
11006[label="zx300/Neg zx3000",fontsize=10,color="white",style="solid",shape="box"];348 -> 11006[label="",style="solid", color="burlywood", weight=9];
11006 -> 415[label="",style="solid", color="burlywood", weight=3];
1935[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos zx1300) (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11007[label="zx1300/Succ zx13000",fontsize=10,color="white",style="solid",shape="box"];1935 -> 11007[label="",style="solid", color="burlywood", weight=9];
11007 -> 1950[label="",style="solid", color="burlywood", weight=3];
11008[label="zx1300/Zero",fontsize=10,color="white",style="solid",shape="box"];1935 -> 11008[label="",style="solid", color="burlywood", weight=9];
11008 -> 1951[label="",style="solid", color="burlywood", weight=3];
1936[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg zx1300) (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11009[label="zx1300/Succ zx13000",fontsize=10,color="white",style="solid",shape="box"];1936 -> 11009[label="",style="solid", color="burlywood", weight=9];
11009 -> 1952[label="",style="solid", color="burlywood", weight=3];
11010[label="zx1300/Zero",fontsize=10,color="white",style="solid",shape="box"];1936 -> 11010[label="",style="solid", color="burlywood", weight=9];
11010 -> 1953[label="",style="solid", color="burlywood", weight=3];
4010[label="primPlusNat zx2450 zx15300",fontsize=16,color="burlywood",shape="triangle"];11011[label="zx2450/Succ zx24500",fontsize=10,color="white",style="solid",shape="box"];4010 -> 11011[label="",style="solid", color="burlywood", weight=9];
11011 -> 4046[label="",style="solid", color="burlywood", weight=3];
11012[label="zx2450/Zero",fontsize=10,color="white",style="solid",shape="box"];4010 -> 11012[label="",style="solid", color="burlywood", weight=9];
11012 -> 4047[label="",style="solid", color="burlywood", weight=3];
349[label="rangeSize1 (Pos (Succ zx3000)) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3000) (Succ zx3100) == GT))))",fontsize=16,color="black",shape="box"];349 -> 416[label="",style="solid", color="black", weight=3];
350[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3000) Zero == GT))))",fontsize=16,color="black",shape="box"];350 -> 417[label="",style="solid", color="black", weight=3];
351[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];351 -> 418[label="",style="solid", color="black", weight=3];
352[label="rangeSize1 (Pos Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx3100) == GT))))",fontsize=16,color="black",shape="box"];352 -> 419[label="",style="solid", color="black", weight=3];
353[label="rangeSize1 (Pos Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];353 -> 420[label="",style="solid", color="black", weight=3];
354[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];354 -> 421[label="",style="solid", color="black", weight=3];
355[label="rangeSize1 (Pos Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];355 -> 422[label="",style="solid", color="black", weight=3];
356[label="rangeSize1 (Neg (Succ zx3000)) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];356 -> 423[label="",style="solid", color="black", weight=3];
357[label="rangeSize1 (Neg (Succ zx3000)) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3100) (Succ zx3000) == GT))))",fontsize=16,color="black",shape="box"];357 -> 424[label="",style="solid", color="black", weight=3];
358[label="rangeSize1 (Neg (Succ zx3000)) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx3000) == GT))))",fontsize=16,color="black",shape="box"];358 -> 425[label="",style="solid", color="black", weight=3];
359[label="rangeSize1 (Neg Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];359 -> 426[label="",style="solid", color="black", weight=3];
360[label="rangeSize1 (Neg Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];360 -> 427[label="",style="solid", color="black", weight=3];
361[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3100) Zero == GT))))",fontsize=16,color="black",shape="box"];361 -> 428[label="",style="solid", color="black", weight=3];
362[label="rangeSize1 (Neg Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];362 -> 429[label="",style="solid", color="black", weight=3];
363[label="rangeSize1 zx30 LT (null ((++) range40 LT (not False && LT >= zx30) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];363 -> 430[label="",style="solid", color="black", weight=3];
364[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare1 EQ LT False == LT) && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];364 -> 431[label="",style="solid", color="black", weight=3];
365[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare1 GT LT False == LT) && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];365 -> 432[label="",style="solid", color="black", weight=3];
366[label="rangeSize1 zx30 False (null ((++) range00 False (not False && False >= zx30) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];366 -> 433[label="",style="solid", color="black", weight=3];
367[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare1 True False False == LT) && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];367 -> 434[label="",style="solid", color="black", weight=3];
368 -> 104[label="",style="dashed", color="red", weight=0];
368[label="range (zx3000,zx3100)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];368 -> 435[label="",style="dashed", color="magenta", weight=3];
368 -> 436[label="",style="dashed", color="magenta", weight=3];
369 -> 105[label="",style="dashed", color="red", weight=0];
369[label="range (zx3000,zx3100)\n  Ix a  Ix b",fontsize=16,color="magenta"];369 -> 437[label="",style="dashed", color="magenta", weight=3];
369 -> 438[label="",style="dashed", color="magenta", weight=3];
370 -> 106[label="",style="dashed", color="red", weight=0];
370[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];370 -> 439[label="",style="dashed", color="magenta", weight=3];
370 -> 440[label="",style="dashed", color="magenta", weight=3];
371 -> 107[label="",style="dashed", color="red", weight=0];
371[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];371 -> 441[label="",style="dashed", color="magenta", weight=3];
371 -> 442[label="",style="dashed", color="magenta", weight=3];
372 -> 108[label="",style="dashed", color="red", weight=0];
372[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];372 -> 443[label="",style="dashed", color="magenta", weight=3];
372 -> 444[label="",style="dashed", color="magenta", weight=3];
373 -> 109[label="",style="dashed", color="red", weight=0];
373[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];373 -> 445[label="",style="dashed", color="magenta", weight=3];
373 -> 446[label="",style="dashed", color="magenta", weight=3];
374 -> 110[label="",style="dashed", color="red", weight=0];
374[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];374 -> 447[label="",style="dashed", color="magenta", weight=3];
374 -> 448[label="",style="dashed", color="magenta", weight=3];
375 -> 111[label="",style="dashed", color="red", weight=0];
375[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];375 -> 449[label="",style="dashed", color="magenta", weight=3];
375 -> 450[label="",style="dashed", color="magenta", weight=3];
378 -> 104[label="",style="dashed", color="red", weight=0];
378[label="range (zx3000,zx3100)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];378 -> 453[label="",style="dashed", color="magenta", weight=3];
378 -> 454[label="",style="dashed", color="magenta", weight=3];
379 -> 105[label="",style="dashed", color="red", weight=0];
379[label="range (zx3000,zx3100)\n  Ix a  Ix b",fontsize=16,color="magenta"];379 -> 455[label="",style="dashed", color="magenta", weight=3];
379 -> 456[label="",style="dashed", color="magenta", weight=3];
380 -> 106[label="",style="dashed", color="red", weight=0];
380[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];380 -> 457[label="",style="dashed", color="magenta", weight=3];
380 -> 458[label="",style="dashed", color="magenta", weight=3];
381 -> 107[label="",style="dashed", color="red", weight=0];
381[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];381 -> 459[label="",style="dashed", color="magenta", weight=3];
381 -> 460[label="",style="dashed", color="magenta", weight=3];
382 -> 108[label="",style="dashed", color="red", weight=0];
382[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];382 -> 461[label="",style="dashed", color="magenta", weight=3];
382 -> 462[label="",style="dashed", color="magenta", weight=3];
383 -> 109[label="",style="dashed", color="red", weight=0];
383[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];383 -> 463[label="",style="dashed", color="magenta", weight=3];
383 -> 464[label="",style="dashed", color="magenta", weight=3];
384 -> 110[label="",style="dashed", color="red", weight=0];
384[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];384 -> 465[label="",style="dashed", color="magenta", weight=3];
384 -> 466[label="",style="dashed", color="magenta", weight=3];
385 -> 111[label="",style="dashed", color="red", weight=0];
385[label="range (zx3000,zx3100)",fontsize=16,color="magenta"];385 -> 467[label="",style="dashed", color="magenta", weight=3];
385 -> 468[label="",style="dashed", color="magenta", weight=3];
388[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) (compare zx300 zx310 /= GT)",fontsize=16,color="black",shape="box"];388 -> 471[label="",style="solid", color="black", weight=3];
389[label="(++) range40 LT (compare zx310 LT /= LT && LT >= zx300) foldr (++) [] (map (range4 zx310 zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];389 -> 472[label="",style="solid", color="black", weight=3];
390[label="(++) range00 False (compare zx310 False /= LT && False >= zx300) foldr (++) [] (map (range0 zx310 zx300) (True : []))",fontsize=16,color="black",shape="box"];390 -> 473[label="",style="solid", color="black", weight=3];
1116 -> 306[label="",style="dashed", color="red", weight=0];
1116[label="foldr (++) [] (map (range3 zx38 zx39 zx40 zx41) zx421)",fontsize=16,color="magenta"];1116 -> 1132[label="",style="dashed", color="magenta", weight=3];
1117[label="range3 zx38 zx39 zx40 zx41 zx420",fontsize=16,color="black",shape="box"];1117 -> 1133[label="",style="solid", color="black", weight=3];
1115[label="(++) zx105 zx88",fontsize=16,color="burlywood",shape="triangle"];11030[label="zx105/zx1050 : zx1051",fontsize=10,color="white",style="solid",shape="box"];1115 -> 11030[label="",style="solid", color="burlywood", weight=9];
11030 -> 1134[label="",style="solid", color="burlywood", weight=3];
11031[label="zx105/[]",fontsize=10,color="white",style="solid",shape="box"];1115 -> 11031[label="",style="solid", color="burlywood", weight=9];
11031 -> 1135[label="",style="solid", color="burlywood", weight=3];
819 -> 894[label="",style="dashed", color="red", weight=0];
819[label="foldr (++) [] (map (range2 zx180 zx14 zx17) (range (zx13,zx16)))\n  Ix a  Ix b",fontsize=16,color="magenta"];819 -> 895[label="",style="dashed", color="magenta", weight=3];
819 -> 896[label="",style="dashed", color="magenta", weight=3];
819 -> 897[label="",style="dashed", color="magenta", weight=3];
819 -> 898[label="",style="dashed", color="magenta", weight=3];
820[label="rangeSize0 (zx62,zx63,zx64) (zx65,zx66,zx67) True\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];820 -> 902[label="",style="solid", color="black", weight=3];
821[label="zx62\n  Ix a",fontsize=16,color="green",shape="box"];822[label="zx65\n  Ix a",fontsize=16,color="green",shape="box"];823[label="zx66\n  Ix a",fontsize=16,color="green",shape="box"];824[label="zx63\n  Ix a",fontsize=16,color="green",shape="box"];825[label="zx67\n  Ix a",fontsize=16,color="green",shape="box"];826[label="zx64\n  Ix a",fontsize=16,color="green",shape="box"];1292[label="range6 zx47 zx48 zx490",fontsize=16,color="black",shape="box"];1292 -> 1300[label="",style="solid", color="black", weight=3];
1293 -> 317[label="",style="dashed", color="red", weight=0];
1293[label="foldr (++) [] (map (range6 zx47 zx48) zx491)",fontsize=16,color="magenta"];1293 -> 1301[label="",style="dashed", color="magenta", weight=3];
1291[label="(++) zx126 zx89",fontsize=16,color="burlywood",shape="triangle"];11034[label="zx126/zx1260 : zx1261",fontsize=10,color="white",style="solid",shape="box"];1291 -> 11034[label="",style="solid", color="burlywood", weight=9];
11034 -> 1302[label="",style="solid", color="burlywood", weight=3];
11035[label="zx126/[]",fontsize=10,color="white",style="solid",shape="box"];1291 -> 11035[label="",style="solid", color="burlywood", weight=9];
11035 -> 1303[label="",style="solid", color="burlywood", weight=3];
1126 -> 1235[label="",style="dashed", color="red", weight=0];
1126[label="foldr (++) [] (map (range5 zx290) (range (zx26,zx28)))\n  Ix a",fontsize=16,color="magenta"];1126 -> 1236[label="",style="dashed", color="magenta", weight=3];
1126 -> 1237[label="",style="dashed", color="magenta", weight=3];
1127[label="rangeSize0 (zx81,zx82) (zx83,zx84) True\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];1127 -> 1238[label="",style="solid", color="black", weight=3];
1128[label="zx83\n  Ix a",fontsize=16,color="green",shape="box"];1129[label="zx82\n  Ix a",fontsize=16,color="green",shape="box"];1130[label="zx84\n  Ix a",fontsize=16,color="green",shape="box"];1131[label="zx81\n  Ix a",fontsize=16,color="green",shape="box"];402[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx30000) zx3100 == GT))))",fontsize=16,color="burlywood",shape="box"];11037[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];402 -> 11037[label="",style="solid", color="burlywood", weight=9];
11037 -> 499[label="",style="solid", color="burlywood", weight=3];
11038[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];402 -> 11038[label="",style="solid", color="burlywood", weight=9];
11038 -> 500[label="",style="solid", color="burlywood", weight=3];
403[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];403 -> 501[label="",style="solid", color="black", weight=3];
404[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ zx31000)) == GT))))",fontsize=16,color="black",shape="box"];404 -> 502[label="",style="solid", color="black", weight=3];
405[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))))",fontsize=16,color="black",shape="box"];405 -> 503[label="",style="solid", color="black", weight=3];
406[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg (Succ zx31000)) == GT))))",fontsize=16,color="black",shape="box"];406 -> 504[label="",style="solid", color="black", weight=3];
407[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg Zero) == GT))))",fontsize=16,color="black",shape="box"];407 -> 505[label="",style="solid", color="black", weight=3];
408[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];408 -> 506[label="",style="solid", color="black", weight=3];
409[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx3100 (Succ zx30000) == GT))))",fontsize=16,color="burlywood",shape="box"];11039[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];409 -> 11039[label="",style="solid", color="burlywood", weight=9];
11039 -> 507[label="",style="solid", color="burlywood", weight=3];
11040[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];409 -> 11040[label="",style="solid", color="burlywood", weight=9];
11040 -> 508[label="",style="solid", color="burlywood", weight=3];
410[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos (Succ zx31000)) == GT))))",fontsize=16,color="black",shape="box"];410 -> 509[label="",style="solid", color="black", weight=3];
411[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos Zero) == GT))))",fontsize=16,color="black",shape="box"];411 -> 510[label="",style="solid", color="black", weight=3];
412[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg (Succ zx31000)) == GT))))",fontsize=16,color="black",shape="box"];412 -> 511[label="",style="solid", color="black", weight=3];
413[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))))",fontsize=16,color="black",shape="box"];413 -> 512[label="",style="solid", color="black", weight=3];
414[label="takeWhile1 (flip (<=) zx310) (Pos zx3000) (numericEnumFrom $! Pos zx3000 + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos zx3000) zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11041[label="zx3000/Succ zx30000",fontsize=10,color="white",style="solid",shape="box"];414 -> 11041[label="",style="solid", color="burlywood", weight=9];
11041 -> 513[label="",style="solid", color="burlywood", weight=3];
11042[label="zx3000/Zero",fontsize=10,color="white",style="solid",shape="box"];414 -> 11042[label="",style="solid", color="burlywood", weight=9];
11042 -> 514[label="",style="solid", color="burlywood", weight=3];
415[label="takeWhile1 (flip (<=) zx310) (Neg zx3000) (numericEnumFrom $! Neg zx3000 + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg zx3000) zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11043[label="zx3000/Succ zx30000",fontsize=10,color="white",style="solid",shape="box"];415 -> 11043[label="",style="solid", color="burlywood", weight=9];
11043 -> 515[label="",style="solid", color="burlywood", weight=3];
11044[label="zx3000/Zero",fontsize=10,color="white",style="solid",shape="box"];415 -> 11044[label="",style="solid", color="burlywood", weight=9];
11044 -> 516[label="",style="solid", color="burlywood", weight=3];
1950[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx13000)) (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];1950 -> 1960[label="",style="solid", color="black", weight=3];
1951[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];1951 -> 1961[label="",style="solid", color="black", weight=3];
1952[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx13000)) (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];1952 -> 1962[label="",style="solid", color="black", weight=3];
1953[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (inRangeI zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];1953 -> 1963[label="",style="solid", color="black", weight=3];
4046[label="primPlusNat (Succ zx24500) zx15300",fontsize=16,color="burlywood",shape="box"];11045[label="zx15300/Succ zx153000",fontsize=10,color="white",style="solid",shape="box"];4046 -> 11045[label="",style="solid", color="burlywood", weight=9];
11045 -> 4160[label="",style="solid", color="burlywood", weight=3];
11046[label="zx15300/Zero",fontsize=10,color="white",style="solid",shape="box"];4046 -> 11046[label="",style="solid", color="burlywood", weight=9];
11046 -> 4161[label="",style="solid", color="burlywood", weight=3];
4047[label="primPlusNat Zero zx15300",fontsize=16,color="burlywood",shape="box"];11047[label="zx15300/Succ zx153000",fontsize=10,color="white",style="solid",shape="box"];4047 -> 11047[label="",style="solid", color="burlywood", weight=9];
11047 -> 4162[label="",style="solid", color="burlywood", weight=3];
11048[label="zx15300/Zero",fontsize=10,color="white",style="solid",shape="box"];4047 -> 11048[label="",style="solid", color="burlywood", weight=9];
11048 -> 4163[label="",style="solid", color="burlywood", weight=3];
416 -> 4656[label="",style="dashed", color="red", weight=0];
416[label="rangeSize1 (Pos (Succ zx3000)) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx3000 zx3100 == GT))))",fontsize=16,color="magenta"];416 -> 4657[label="",style="dashed", color="magenta", weight=3];
416 -> 4658[label="",style="dashed", color="magenta", weight=3];
416 -> 4659[label="",style="dashed", color="magenta", weight=3];
417[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];417 -> 519[label="",style="solid", color="black", weight=3];
418[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) (null (takeWhile1 (flip (<=) (Neg zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];418 -> 520[label="",style="solid", color="black", weight=3];
419[label="rangeSize1 (Pos Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];419 -> 521[label="",style="solid", color="black", weight=3];
420[label="rangeSize1 (Pos Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];420 -> 522[label="",style="solid", color="black", weight=3];
421[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];421 -> 523[label="",style="solid", color="black", weight=3];
422[label="rangeSize1 (Pos Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];422 -> 524[label="",style="solid", color="black", weight=3];
423[label="rangeSize1 (Neg (Succ zx3000)) (Pos zx310) (null (takeWhile1 (flip (<=) (Pos zx310)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];423 -> 525[label="",style="solid", color="black", weight=3];
424 -> 5763[label="",style="dashed", color="red", weight=0];
424[label="rangeSize1 (Neg (Succ zx3000)) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx3100 zx3000 == GT))))",fontsize=16,color="magenta"];424 -> 5764[label="",style="dashed", color="magenta", weight=3];
424 -> 5765[label="",style="dashed", color="magenta", weight=3];
424 -> 5766[label="",style="dashed", color="magenta", weight=3];
425[label="rangeSize1 (Neg (Succ zx3000)) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];425 -> 528[label="",style="solid", color="black", weight=3];
426[label="rangeSize1 (Neg Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];426 -> 529[label="",style="solid", color="black", weight=3];
427[label="rangeSize1 (Neg Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];427 -> 530[label="",style="solid", color="black", weight=3];
428[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];428 -> 531[label="",style="solid", color="black", weight=3];
429[label="rangeSize1 (Neg Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];429 -> 532[label="",style="solid", color="black", weight=3];
430[label="rangeSize1 zx30 LT (null ((++) range40 LT (True && LT >= zx30) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];430 -> 533[label="",style="solid", color="black", weight=3];
431[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare0 EQ LT otherwise == LT) && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];431 -> 534[label="",style="solid", color="black", weight=3];
432[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare0 GT LT otherwise == LT) && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];432 -> 535[label="",style="solid", color="black", weight=3];
433[label="rangeSize1 zx30 False (null ((++) range00 False (True && False >= zx30) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];433 -> 536[label="",style="solid", color="black", weight=3];
434[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare0 True False otherwise == LT) && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];434 -> 537[label="",style="solid", color="black", weight=3];
435[label="zx3000\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];436[label="zx3100\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];437[label="zx3000\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];438[label="zx3100\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];439[label="zx3000",fontsize=16,color="green",shape="box"];440[label="zx3100",fontsize=16,color="green",shape="box"];441[label="zx3000",fontsize=16,color="green",shape="box"];442[label="zx3100",fontsize=16,color="green",shape="box"];443[label="zx3000",fontsize=16,color="green",shape="box"];444[label="zx3100",fontsize=16,color="green",shape="box"];445[label="zx3000",fontsize=16,color="green",shape="box"];446[label="zx3100",fontsize=16,color="green",shape="box"];447[label="zx3000",fontsize=16,color="green",shape="box"];448[label="zx3100",fontsize=16,color="green",shape="box"];449[label="zx3000",fontsize=16,color="green",shape="box"];450[label="zx3100",fontsize=16,color="green",shape="box"];453[label="zx3000\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];454[label="zx3100\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];455[label="zx3000\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];456[label="zx3100\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];457[label="zx3000",fontsize=16,color="green",shape="box"];458[label="zx3100",fontsize=16,color="green",shape="box"];459[label="zx3000",fontsize=16,color="green",shape="box"];460[label="zx3100",fontsize=16,color="green",shape="box"];461[label="zx3000",fontsize=16,color="green",shape="box"];462[label="zx3100",fontsize=16,color="green",shape="box"];463[label="zx3000",fontsize=16,color="green",shape="box"];464[label="zx3100",fontsize=16,color="green",shape="box"];465[label="zx3000",fontsize=16,color="green",shape="box"];466[label="zx3100",fontsize=16,color="green",shape="box"];467[label="zx3000",fontsize=16,color="green",shape="box"];468[label="zx3100",fontsize=16,color="green",shape="box"];471[label="takeWhile1 (flip (<=) zx310) zx300 (numericEnumFrom $! zx300 + fromInt (Pos (Succ Zero))) (not (compare zx300 zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11051[label="zx300/Integer zx3000",fontsize=10,color="white",style="solid",shape="box"];471 -> 11051[label="",style="solid", color="burlywood", weight=9];
11051 -> 542[label="",style="solid", color="burlywood", weight=3];
472[label="(++) range40 LT (not (compare zx310 LT == LT) && LT >= zx300) foldr (++) [] (map (range4 zx310 zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];472 -> 543[label="",style="solid", color="black", weight=3];
473[label="(++) range00 False (not (compare zx310 False == LT) && False >= zx300) foldr (++) [] (map (range0 zx310 zx300) (True : []))",fontsize=16,color="black",shape="box"];473 -> 544[label="",style="solid", color="black", weight=3];
1132[label="zx421",fontsize=16,color="green",shape="box"];1133[label="range30 zx38 zx39 zx40 zx41 zx420",fontsize=16,color="black",shape="box"];1133 -> 1239[label="",style="solid", color="black", weight=3];
1134[label="(++) (zx1050 : zx1051) zx88",fontsize=16,color="black",shape="box"];1134 -> 1240[label="",style="solid", color="black", weight=3];
1135[label="(++) [] zx88",fontsize=16,color="black",shape="box"];1135 -> 1241[label="",style="solid", color="black", weight=3];
895[label="range (zx13,zx16)\n  Ix a",fontsize=16,color="blue",shape="box"];11052[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];895 -> 11052[label="",style="solid", color="blue", weight=9];
11052 -> 903[label="",style="solid", color="blue", weight=3];
11053[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];895 -> 11053[label="",style="solid", color="blue", weight=9];
11053 -> 904[label="",style="solid", color="blue", weight=3];
11054[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];895 -> 11054[label="",style="solid", color="blue", weight=9];
11054 -> 905[label="",style="solid", color="blue", weight=3];
11055[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];895 -> 11055[label="",style="solid", color="blue", weight=9];
11055 -> 906[label="",style="solid", color="blue", weight=3];
11056[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];895 -> 11056[label="",style="solid", color="blue", weight=9];
11056 -> 907[label="",style="solid", color="blue", weight=3];
11057[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];895 -> 11057[label="",style="solid", color="blue", weight=9];
11057 -> 908[label="",style="solid", color="blue", weight=3];
11058[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];895 -> 11058[label="",style="solid", color="blue", weight=9];
11058 -> 909[label="",style="solid", color="blue", weight=3];
11059[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];895 -> 11059[label="",style="solid", color="blue", weight=9];
11059 -> 910[label="",style="solid", color="blue", weight=3];
896[label="zx17\n  Ix a",fontsize=16,color="green",shape="box"];897[label="zx14\n  Ix a",fontsize=16,color="green",shape="box"];898[label="zx180",fontsize=16,color="green",shape="box"];894[label="foldr (++) [] (map (range2 zx101 zx102 zx103) zx104)",fontsize=16,color="burlywood",shape="triangle"];11060[label="zx104/zx1040 : zx1041",fontsize=10,color="white",style="solid",shape="box"];894 -> 11060[label="",style="solid", color="burlywood", weight=9];
11060 -> 911[label="",style="solid", color="burlywood", weight=3];
11061[label="zx104/[]",fontsize=10,color="white",style="solid",shape="box"];894 -> 11061[label="",style="solid", color="burlywood", weight=9];
11061 -> 912[label="",style="solid", color="burlywood", weight=3];
902 -> 1381[label="",style="dashed", color="red", weight=0];
902[label="index ((zx62,zx63,zx64),(zx65,zx66,zx67)) (zx65,zx66,zx67) + Pos (Succ Zero)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];902 -> 1384[label="",style="dashed", color="magenta", weight=3];
1300[label="range60 zx47 zx48 zx490",fontsize=16,color="black",shape="box"];1300 -> 1397[label="",style="solid", color="black", weight=3];
1301[label="zx491",fontsize=16,color="green",shape="box"];1302[label="(++) (zx1260 : zx1261) zx89",fontsize=16,color="black",shape="box"];1302 -> 1398[label="",style="solid", color="black", weight=3];
1303[label="(++) [] zx89",fontsize=16,color="black",shape="box"];1303 -> 1399[label="",style="solid", color="black", weight=3];
1236[label="zx290",fontsize=16,color="green",shape="box"];1237[label="range (zx26,zx28)\n  Ix a",fontsize=16,color="blue",shape="box"];11063[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11063[label="",style="solid", color="blue", weight=9];
11063 -> 1242[label="",style="solid", color="blue", weight=3];
11064[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11064[label="",style="solid", color="blue", weight=9];
11064 -> 1243[label="",style="solid", color="blue", weight=3];
11065[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11065[label="",style="solid", color="blue", weight=9];
11065 -> 1244[label="",style="solid", color="blue", weight=3];
11066[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11066[label="",style="solid", color="blue", weight=9];
11066 -> 1245[label="",style="solid", color="blue", weight=3];
11067[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11067[label="",style="solid", color="blue", weight=9];
11067 -> 1246[label="",style="solid", color="blue", weight=3];
11068[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11068[label="",style="solid", color="blue", weight=9];
11068 -> 1247[label="",style="solid", color="blue", weight=3];
11069[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11069[label="",style="solid", color="blue", weight=9];
11069 -> 1248[label="",style="solid", color="blue", weight=3];
11070[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];1237 -> 11070[label="",style="solid", color="blue", weight=9];
11070 -> 1249[label="",style="solid", color="blue", weight=3];
1235[label="foldr (++) [] (map (range5 zx109) zx110)",fontsize=16,color="burlywood",shape="triangle"];11071[label="zx110/zx1100 : zx1101",fontsize=10,color="white",style="solid",shape="box"];1235 -> 11071[label="",style="solid", color="burlywood", weight=9];
11071 -> 1250[label="",style="solid", color="burlywood", weight=3];
11072[label="zx110/[]",fontsize=10,color="white",style="solid",shape="box"];1235 -> 11072[label="",style="solid", color="burlywood", weight=9];
11072 -> 1251[label="",style="solid", color="burlywood", weight=3];
1238 -> 1381[label="",style="dashed", color="red", weight=0];
1238[label="index ((zx81,zx82),(zx83,zx84)) (zx83,zx84) + Pos (Succ Zero)\n  Ix a  Ix b",fontsize=16,color="magenta"];1238 -> 1385[label="",style="dashed", color="magenta", weight=3];
499[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx30000) (Succ zx31000) == GT))))",fontsize=16,color="black",shape="box"];499 -> 566[label="",style="solid", color="black", weight=3];
500[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx30000) Zero == GT))))",fontsize=16,color="black",shape="box"];500 -> 567[label="",style="solid", color="black", weight=3];
501[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];501 -> 568[label="",style="solid", color="black", weight=3];
502[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx31000) == GT))))",fontsize=16,color="black",shape="box"];502 -> 569[label="",style="solid", color="black", weight=3];
503[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];503 -> 570[label="",style="solid", color="black", weight=3];
504[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];504 -> 571[label="",style="solid", color="black", weight=3];
505[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];505 -> 572[label="",style="solid", color="black", weight=3];
506[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];506 -> 573[label="",style="solid", color="black", weight=3];
507[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx31000) (Succ zx30000) == GT))))",fontsize=16,color="black",shape="box"];507 -> 574[label="",style="solid", color="black", weight=3];
508[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx30000) == GT))))",fontsize=16,color="black",shape="box"];508 -> 575[label="",style="solid", color="black", weight=3];
509[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];509 -> 576[label="",style="solid", color="black", weight=3];
510[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];510 -> 577[label="",style="solid", color="black", weight=3];
511[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx31000) Zero == GT))))",fontsize=16,color="black",shape="box"];511 -> 578[label="",style="solid", color="black", weight=3];
512[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];512 -> 579[label="",style="solid", color="black", weight=3];
513[label="takeWhile1 (flip (<=) zx310) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx30000)) zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11074[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];513 -> 11074[label="",style="solid", color="burlywood", weight=9];
11074 -> 580[label="",style="solid", color="burlywood", weight=3];
11075[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];513 -> 11075[label="",style="solid", color="burlywood", weight=9];
11075 -> 581[label="",style="solid", color="burlywood", weight=3];
514[label="takeWhile1 (flip (<=) zx310) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11076[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];514 -> 11076[label="",style="solid", color="burlywood", weight=9];
11076 -> 582[label="",style="solid", color="burlywood", weight=3];
11077[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];514 -> 11077[label="",style="solid", color="burlywood", weight=9];
11077 -> 583[label="",style="solid", color="burlywood", weight=3];
515[label="takeWhile1 (flip (<=) zx310) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx30000)) zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11078[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];515 -> 11078[label="",style="solid", color="burlywood", weight=9];
11078 -> 584[label="",style="solid", color="burlywood", weight=3];
11079[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];515 -> 11079[label="",style="solid", color="burlywood", weight=9];
11079 -> 585[label="",style="solid", color="burlywood", weight=3];
516[label="takeWhile1 (flip (<=) zx310) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11080[label="zx310/Pos zx3100",fontsize=10,color="white",style="solid",shape="box"];516 -> 11080[label="",style="solid", color="burlywood", weight=9];
11080 -> 586[label="",style="solid", color="burlywood", weight=3];
11081[label="zx310/Neg zx3100",fontsize=10,color="white",style="solid",shape="box"];516 -> 11081[label="",style="solid", color="burlywood", weight=9];
11081 -> 587[label="",style="solid", color="burlywood", weight=3];
1960 -> 2147[label="",style="dashed", color="red", weight=0];
1960[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx13000)) (fromEnum zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];1960 -> 2148[label="",style="dashed", color="magenta", weight=3];
1961 -> 2149[label="",style="dashed", color="red", weight=0];
1961[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (fromEnum zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];1961 -> 2150[label="",style="dashed", color="magenta", weight=3];
1962 -> 2151[label="",style="dashed", color="red", weight=0];
1962[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx13000)) (fromEnum zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];1962 -> 2152[label="",style="dashed", color="magenta", weight=3];
1963 -> 2153[label="",style="dashed", color="red", weight=0];
1963[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (fromEnum zx31) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];1963 -> 2154[label="",style="dashed", color="magenta", weight=3];
4160[label="primPlusNat (Succ zx24500) (Succ zx153000)",fontsize=16,color="black",shape="box"];4160 -> 4168[label="",style="solid", color="black", weight=3];
4161[label="primPlusNat (Succ zx24500) Zero",fontsize=16,color="black",shape="box"];4161 -> 4169[label="",style="solid", color="black", weight=3];
4162[label="primPlusNat Zero (Succ zx153000)",fontsize=16,color="black",shape="box"];4162 -> 4170[label="",style="solid", color="black", weight=3];
4163[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];4163 -> 4171[label="",style="solid", color="black", weight=3];
4657[label="zx3000",fontsize=16,color="green",shape="box"];4658 -> 6244[label="",style="dashed", color="red", weight=0];
4658[label="takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx3000 zx3100 == GT))",fontsize=16,color="magenta"];4658 -> 6245[label="",style="dashed", color="magenta", weight=3];
4658 -> 6246[label="",style="dashed", color="magenta", weight=3];
4658 -> 6247[label="",style="dashed", color="magenta", weight=3];
4658 -> 6248[label="",style="dashed", color="magenta", weight=3];
4658 -> 6249[label="",style="dashed", color="magenta", weight=3];
4659[label="zx3100",fontsize=16,color="green",shape="box"];4656[label="rangeSize1 (Pos (Succ zx291)) (Pos (Succ zx292)) (null zx293)",fontsize=16,color="burlywood",shape="triangle"];11087[label="zx293/zx2930 : zx2931",fontsize=10,color="white",style="solid",shape="box"];4656 -> 11087[label="",style="solid", color="burlywood", weight=9];
11087 -> 4780[label="",style="solid", color="burlywood", weight=3];
11088[label="zx293/[]",fontsize=10,color="white",style="solid",shape="box"];4656 -> 11088[label="",style="solid", color="burlywood", weight=9];
11088 -> 4781[label="",style="solid", color="burlywood", weight=3];
519[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];519 -> 592[label="",style="solid", color="black", weight=3];
520[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) (null (takeWhile0 (flip (<=) (Neg zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];520 -> 593[label="",style="solid", color="black", weight=3];
521[label="rangeSize1 (Pos Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];521 -> 594[label="",style="solid", color="black", weight=3];
522[label="rangeSize1 (Pos Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];522 -> 595[label="",style="solid", color="black", weight=3];
523[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];523 -> 596[label="",style="solid", color="black", weight=3];
524[label="rangeSize1 (Pos Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];524 -> 597[label="",style="solid", color="black", weight=3];
525[label="rangeSize1 (Neg (Succ zx3000)) (Pos zx310) (null (Neg (Succ zx3000) : takeWhile (flip (<=) (Pos zx310)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];525 -> 598[label="",style="solid", color="black", weight=3];
5764[label="zx3100",fontsize=16,color="green",shape="box"];5765[label="zx3000",fontsize=16,color="green",shape="box"];5766 -> 6310[label="",style="dashed", color="red", weight=0];
5766[label="takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx3100 zx3000 == GT))",fontsize=16,color="magenta"];5766 -> 6311[label="",style="dashed", color="magenta", weight=3];
5766 -> 6312[label="",style="dashed", color="magenta", weight=3];
5766 -> 6313[label="",style="dashed", color="magenta", weight=3];
5766 -> 6314[label="",style="dashed", color="magenta", weight=3];
5766 -> 6315[label="",style="dashed", color="magenta", weight=3];
5763[label="rangeSize1 (Neg (Succ zx353)) (Neg (Succ zx354)) (null zx363)",fontsize=16,color="burlywood",shape="triangle"];11090[label="zx363/zx3630 : zx3631",fontsize=10,color="white",style="solid",shape="box"];5763 -> 11090[label="",style="solid", color="burlywood", weight=9];
11090 -> 5778[label="",style="solid", color="burlywood", weight=3];
11091[label="zx363/[]",fontsize=10,color="white",style="solid",shape="box"];5763 -> 11091[label="",style="solid", color="burlywood", weight=9];
11091 -> 5779[label="",style="solid", color="burlywood", weight=3];
528[label="rangeSize1 (Neg (Succ zx3000)) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];528 -> 603[label="",style="solid", color="black", weight=3];
529[label="rangeSize1 (Neg Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];529 -> 604[label="",style="solid", color="black", weight=3];
530[label="rangeSize1 (Neg Zero) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];530 -> 605[label="",style="solid", color="black", weight=3];
531[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];531 -> 606[label="",style="solid", color="black", weight=3];
532[label="rangeSize1 (Neg Zero) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];532 -> 607[label="",style="solid", color="black", weight=3];
533[label="rangeSize1 zx30 LT (null ((++) range40 LT (LT >= zx30) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];533 -> 608[label="",style="solid", color="black", weight=3];
534[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare0 EQ LT True == LT) && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];534 -> 609[label="",style="solid", color="black", weight=3];
535[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare0 GT LT True == LT) && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];535 -> 610[label="",style="solid", color="black", weight=3];
536[label="rangeSize1 zx30 False (null ((++) range00 False (False >= zx30) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];536 -> 611[label="",style="solid", color="black", weight=3];
537[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare0 True False True == LT) && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];537 -> 612[label="",style="solid", color="black", weight=3];
542[label="takeWhile1 (flip (<=) zx310) (Integer zx3000) (numericEnumFrom $! Integer zx3000 + fromInt (Pos (Succ Zero))) (not (compare (Integer zx3000) zx310 == GT))",fontsize=16,color="burlywood",shape="box"];11092[label="zx310/Integer zx3100",fontsize=10,color="white",style="solid",shape="box"];542 -> 11092[label="",style="solid", color="burlywood", weight=9];
11092 -> 623[label="",style="solid", color="burlywood", weight=3];
543[label="(++) range40 LT (not (compare3 zx310 LT == LT) && LT >= zx300) foldr (++) [] (map (range4 zx310 zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];543 -> 624[label="",style="solid", color="black", weight=3];
544[label="(++) range00 False (not (compare3 zx310 False == LT) && False >= zx300) foldr (++) [] (map (range0 zx310 zx300) (True : []))",fontsize=16,color="black",shape="box"];544 -> 625[label="",style="solid", color="black", weight=3];
1239[label="concatMap (range2 zx420 zx38 zx39) (range (zx40,zx41))",fontsize=16,color="black",shape="box"];1239 -> 1261[label="",style="solid", color="black", weight=3];
1240[label="zx1050 : zx1051 ++ zx88",fontsize=16,color="green",shape="box"];1240 -> 1262[label="",style="dashed", color="green", weight=3];
1241[label="zx88",fontsize=16,color="green",shape="box"];903 -> 104[label="",style="dashed", color="red", weight=0];
903[label="range (zx13,zx16)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];903 -> 1000[label="",style="dashed", color="magenta", weight=3];
903 -> 1001[label="",style="dashed", color="magenta", weight=3];
904 -> 105[label="",style="dashed", color="red", weight=0];
904[label="range (zx13,zx16)\n  Ix a  Ix b",fontsize=16,color="magenta"];904 -> 1002[label="",style="dashed", color="magenta", weight=3];
904 -> 1003[label="",style="dashed", color="magenta", weight=3];
905 -> 106[label="",style="dashed", color="red", weight=0];
905[label="range (zx13,zx16)",fontsize=16,color="magenta"];905 -> 1004[label="",style="dashed", color="magenta", weight=3];
905 -> 1005[label="",style="dashed", color="magenta", weight=3];
906 -> 107[label="",style="dashed", color="red", weight=0];
906[label="range (zx13,zx16)",fontsize=16,color="magenta"];906 -> 1006[label="",style="dashed", color="magenta", weight=3];
906 -> 1007[label="",style="dashed", color="magenta", weight=3];
907 -> 108[label="",style="dashed", color="red", weight=0];
907[label="range (zx13,zx16)",fontsize=16,color="magenta"];907 -> 1008[label="",style="dashed", color="magenta", weight=3];
907 -> 1009[label="",style="dashed", color="magenta", weight=3];
908 -> 109[label="",style="dashed", color="red", weight=0];
908[label="range (zx13,zx16)",fontsize=16,color="magenta"];908 -> 1010[label="",style="dashed", color="magenta", weight=3];
908 -> 1011[label="",style="dashed", color="magenta", weight=3];
909 -> 110[label="",style="dashed", color="red", weight=0];
909[label="range (zx13,zx16)",fontsize=16,color="magenta"];909 -> 1012[label="",style="dashed", color="magenta", weight=3];
909 -> 1013[label="",style="dashed", color="magenta", weight=3];
910 -> 111[label="",style="dashed", color="red", weight=0];
910[label="range (zx13,zx16)",fontsize=16,color="magenta"];910 -> 1014[label="",style="dashed", color="magenta", weight=3];
910 -> 1015[label="",style="dashed", color="magenta", weight=3];
911[label="foldr (++) [] (map (range2 zx101 zx102 zx103) (zx1040 : zx1041))",fontsize=16,color="black",shape="box"];911 -> 1016[label="",style="solid", color="black", weight=3];
912[label="foldr (++) [] (map (range2 zx101 zx102 zx103) [])",fontsize=16,color="black",shape="box"];912 -> 1017[label="",style="solid", color="black", weight=3];
1384[label="index ((zx62,zx63,zx64),(zx65,zx66,zx67)) (zx65,zx66,zx67)\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];1384 -> 1400[label="",style="solid", color="black", weight=3];
1397[label="concatMap (range5 zx490) (range (zx47,zx48))",fontsize=16,color="black",shape="box"];1397 -> 1506[label="",style="solid", color="black", weight=3];
1398[label="zx1260 : zx1261 ++ zx89",fontsize=16,color="green",shape="box"];1398 -> 1507[label="",style="dashed", color="green", weight=3];
1399[label="zx89",fontsize=16,color="green",shape="box"];1242 -> 104[label="",style="dashed", color="red", weight=0];
1242[label="range (zx26,zx28)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];1242 -> 1263[label="",style="dashed", color="magenta", weight=3];
1242 -> 1264[label="",style="dashed", color="magenta", weight=3];
1243 -> 105[label="",style="dashed", color="red", weight=0];
1243[label="range (zx26,zx28)\n  Ix a  Ix b",fontsize=16,color="magenta"];1243 -> 1265[label="",style="dashed", color="magenta", weight=3];
1243 -> 1266[label="",style="dashed", color="magenta", weight=3];
1244 -> 106[label="",style="dashed", color="red", weight=0];
1244[label="range (zx26,zx28)",fontsize=16,color="magenta"];1244 -> 1267[label="",style="dashed", color="magenta", weight=3];
1244 -> 1268[label="",style="dashed", color="magenta", weight=3];
1245 -> 107[label="",style="dashed", color="red", weight=0];
1245[label="range (zx26,zx28)",fontsize=16,color="magenta"];1245 -> 1269[label="",style="dashed", color="magenta", weight=3];
1245 -> 1270[label="",style="dashed", color="magenta", weight=3];
1246 -> 108[label="",style="dashed", color="red", weight=0];
1246[label="range (zx26,zx28)",fontsize=16,color="magenta"];1246 -> 1271[label="",style="dashed", color="magenta", weight=3];
1246 -> 1272[label="",style="dashed", color="magenta", weight=3];
1247 -> 109[label="",style="dashed", color="red", weight=0];
1247[label="range (zx26,zx28)",fontsize=16,color="magenta"];1247 -> 1273[label="",style="dashed", color="magenta", weight=3];
1247 -> 1274[label="",style="dashed", color="magenta", weight=3];
1248 -> 110[label="",style="dashed", color="red", weight=0];
1248[label="range (zx26,zx28)",fontsize=16,color="magenta"];1248 -> 1275[label="",style="dashed", color="magenta", weight=3];
1248 -> 1276[label="",style="dashed", color="magenta", weight=3];
1249 -> 111[label="",style="dashed", color="red", weight=0];
1249[label="range (zx26,zx28)",fontsize=16,color="magenta"];1249 -> 1277[label="",style="dashed", color="magenta", weight=3];
1249 -> 1278[label="",style="dashed", color="magenta", weight=3];
1250[label="foldr (++) [] (map (range5 zx109) (zx1100 : zx1101))",fontsize=16,color="black",shape="box"];1250 -> 1279[label="",style="solid", color="black", weight=3];
1251[label="foldr (++) [] (map (range5 zx109) [])",fontsize=16,color="black",shape="box"];1251 -> 1280[label="",style="solid", color="black", weight=3];
1385[label="index ((zx81,zx82),(zx83,zx84)) (zx83,zx84)\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];1385 -> 1401[label="",style="solid", color="black", weight=3];
566 -> 5983[label="",style="dashed", color="red", weight=0];
566[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx30000 zx31000 == GT))))",fontsize=16,color="magenta"];566 -> 5984[label="",style="dashed", color="magenta", weight=3];
566 -> 5985[label="",style="dashed", color="magenta", weight=3];
566 -> 5986[label="",style="dashed", color="magenta", weight=3];
567[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];567 -> 664[label="",style="solid", color="black", weight=3];
568[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile1 (flip (<=) (Integer (Neg zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];568 -> 665[label="",style="solid", color="black", weight=3];
569[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];569 -> 666[label="",style="solid", color="black", weight=3];
570[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];570 -> 667[label="",style="solid", color="black", weight=3];
571[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];571 -> 668[label="",style="solid", color="black", weight=3];
572[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];572 -> 669[label="",style="solid", color="black", weight=3];
573[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (null (takeWhile1 (flip (<=) (Integer (Pos zx3100))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];573 -> 670[label="",style="solid", color="black", weight=3];
574 -> 5910[label="",style="dashed", color="red", weight=0];
574[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx31000 zx30000 == GT))))",fontsize=16,color="magenta"];574 -> 5911[label="",style="dashed", color="magenta", weight=3];
574 -> 5912[label="",style="dashed", color="magenta", weight=3];
574 -> 5913[label="",style="dashed", color="magenta", weight=3];
574 -> 5914[label="",style="dashed", color="magenta", weight=3];
575[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];575 -> 673[label="",style="solid", color="black", weight=3];
576[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];576 -> 674[label="",style="solid", color="black", weight=3];
577[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];577 -> 675[label="",style="solid", color="black", weight=3];
578[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];578 -> 676[label="",style="solid", color="black", weight=3];
579[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];579 -> 677[label="",style="solid", color="black", weight=3];
580[label="takeWhile1 (flip (<=) (Pos zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx30000)) (Pos zx3100) == GT))",fontsize=16,color="black",shape="box"];580 -> 678[label="",style="solid", color="black", weight=3];
581[label="takeWhile1 (flip (<=) (Neg zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx30000)) (Neg zx3100) == GT))",fontsize=16,color="black",shape="box"];581 -> 679[label="",style="solid", color="black", weight=3];
582[label="takeWhile1 (flip (<=) (Pos zx3100)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos zx3100) == GT))",fontsize=16,color="burlywood",shape="box"];11111[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];582 -> 11111[label="",style="solid", color="burlywood", weight=9];
11111 -> 680[label="",style="solid", color="burlywood", weight=3];
11112[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];582 -> 11112[label="",style="solid", color="burlywood", weight=9];
11112 -> 681[label="",style="solid", color="burlywood", weight=3];
583[label="takeWhile1 (flip (<=) (Neg zx3100)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg zx3100) == GT))",fontsize=16,color="burlywood",shape="box"];11113[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];583 -> 11113[label="",style="solid", color="burlywood", weight=9];
11113 -> 682[label="",style="solid", color="burlywood", weight=3];
11114[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];583 -> 11114[label="",style="solid", color="burlywood", weight=9];
11114 -> 683[label="",style="solid", color="burlywood", weight=3];
584[label="takeWhile1 (flip (<=) (Pos zx3100)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx30000)) (Pos zx3100) == GT))",fontsize=16,color="black",shape="box"];584 -> 684[label="",style="solid", color="black", weight=3];
585[label="takeWhile1 (flip (<=) (Neg zx3100)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx30000)) (Neg zx3100) == GT))",fontsize=16,color="black",shape="box"];585 -> 685[label="",style="solid", color="black", weight=3];
586[label="takeWhile1 (flip (<=) (Pos zx3100)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos zx3100) == GT))",fontsize=16,color="burlywood",shape="box"];11115[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];586 -> 11115[label="",style="solid", color="burlywood", weight=9];
11115 -> 686[label="",style="solid", color="burlywood", weight=3];
11116[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];586 -> 11116[label="",style="solid", color="burlywood", weight=9];
11116 -> 687[label="",style="solid", color="burlywood", weight=3];
587[label="takeWhile1 (flip (<=) (Neg zx3100)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg zx3100) == GT))",fontsize=16,color="burlywood",shape="box"];11117[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];587 -> 11117[label="",style="solid", color="burlywood", weight=9];
11117 -> 688[label="",style="solid", color="burlywood", weight=3];
11118[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];587 -> 11118[label="",style="solid", color="burlywood", weight=9];
11118 -> 689[label="",style="solid", color="burlywood", weight=3];
2148 -> 220[label="",style="dashed", color="red", weight=0];
2148[label="fromEnum zx31",fontsize=16,color="magenta"];2148 -> 2155[label="",style="dashed", color="magenta", weight=3];
2147[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx13000)) zx161 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="triangle"];11120[label="zx161/Pos zx1610",fontsize=10,color="white",style="solid",shape="box"];2147 -> 11120[label="",style="solid", color="burlywood", weight=9];
11120 -> 2156[label="",style="solid", color="burlywood", weight=3];
11121[label="zx161/Neg zx1610",fontsize=10,color="white",style="solid",shape="box"];2147 -> 11121[label="",style="solid", color="burlywood", weight=9];
11121 -> 2157[label="",style="solid", color="burlywood", weight=3];
2150 -> 220[label="",style="dashed", color="red", weight=0];
2150[label="fromEnum zx31",fontsize=16,color="magenta"];2150 -> 2158[label="",style="dashed", color="magenta", weight=3];
2149[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) zx162 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="triangle"];11123[label="zx162/Pos zx1620",fontsize=10,color="white",style="solid",shape="box"];2149 -> 11123[label="",style="solid", color="burlywood", weight=9];
11123 -> 2159[label="",style="solid", color="burlywood", weight=3];
11124[label="zx162/Neg zx1620",fontsize=10,color="white",style="solid",shape="box"];2149 -> 11124[label="",style="solid", color="burlywood", weight=9];
11124 -> 2160[label="",style="solid", color="burlywood", weight=3];
2152 -> 220[label="",style="dashed", color="red", weight=0];
2152[label="fromEnum zx31",fontsize=16,color="magenta"];2152 -> 2161[label="",style="dashed", color="magenta", weight=3];
2151[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx13000)) zx163 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="triangle"];11126[label="zx163/Pos zx1630",fontsize=10,color="white",style="solid",shape="box"];2151 -> 11126[label="",style="solid", color="burlywood", weight=9];
11126 -> 2162[label="",style="solid", color="burlywood", weight=3];
11127[label="zx163/Neg zx1630",fontsize=10,color="white",style="solid",shape="box"];2151 -> 11127[label="",style="solid", color="burlywood", weight=9];
11127 -> 2163[label="",style="solid", color="burlywood", weight=3];
2154 -> 220[label="",style="dashed", color="red", weight=0];
2154[label="fromEnum zx31",fontsize=16,color="magenta"];2154 -> 2164[label="",style="dashed", color="magenta", weight=3];
2153[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) zx164 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="triangle"];11129[label="zx164/Pos zx1640",fontsize=10,color="white",style="solid",shape="box"];2153 -> 11129[label="",style="solid", color="burlywood", weight=9];
11129 -> 2165[label="",style="solid", color="burlywood", weight=3];
11130[label="zx164/Neg zx1640",fontsize=10,color="white",style="solid",shape="box"];2153 -> 11130[label="",style="solid", color="burlywood", weight=9];
11130 -> 2166[label="",style="solid", color="burlywood", weight=3];
4168[label="Succ (Succ (primPlusNat zx24500 zx153000))",fontsize=16,color="green",shape="box"];4168 -> 4176[label="",style="dashed", color="green", weight=3];
4169[label="Succ zx24500",fontsize=16,color="green",shape="box"];4170[label="Succ zx153000",fontsize=16,color="green",shape="box"];4171[label="Zero",fontsize=16,color="green",shape="box"];6245[label="zx3100",fontsize=16,color="green",shape="box"];6246[label="zx3100",fontsize=16,color="green",shape="box"];6247[label="Pos (Succ zx3000) + fromInt (Pos (Succ Zero))",fontsize=16,color="black",shape="triangle"];6247 -> 6305[label="",style="solid", color="black", weight=3];
6248[label="zx3000",fontsize=16,color="green",shape="box"];6249[label="zx3000",fontsize=16,color="green",shape="box"];6244[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat zx432 zx433 == GT))",fontsize=16,color="burlywood",shape="triangle"];11131[label="zx432/Succ zx4320",fontsize=10,color="white",style="solid",shape="box"];6244 -> 11131[label="",style="solid", color="burlywood", weight=9];
11131 -> 6306[label="",style="solid", color="burlywood", weight=3];
11132[label="zx432/Zero",fontsize=10,color="white",style="solid",shape="box"];6244 -> 11132[label="",style="solid", color="burlywood", weight=9];
11132 -> 6307[label="",style="solid", color="burlywood", weight=3];
4780[label="rangeSize1 (Pos (Succ zx291)) (Pos (Succ zx292)) (null (zx2930 : zx2931))",fontsize=16,color="black",shape="box"];4780 -> 4908[label="",style="solid", color="black", weight=3];
4781[label="rangeSize1 (Pos (Succ zx291)) (Pos (Succ zx292)) (null [])",fontsize=16,color="black",shape="box"];4781 -> 4909[label="",style="solid", color="black", weight=3];
592[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) (null (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];592 -> 694[label="",style="solid", color="black", weight=3];
593[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) (null (takeWhile0 (flip (<=) (Neg zx310)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];593 -> 695[label="",style="solid", color="black", weight=3];
594[label="rangeSize1 (Pos Zero) (Pos (Succ zx3100)) (null (takeWhile1 (flip (<=) (Pos (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];594 -> 696[label="",style="solid", color="black", weight=3];
595[label="rangeSize1 (Pos Zero) (Pos Zero) (null (Pos Zero : takeWhile (flip (<=) (Pos Zero)) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];595 -> 697[label="",style="solid", color="black", weight=3];
596[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) (null (takeWhile0 (flip (<=) (Neg (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];596 -> 698[label="",style="solid", color="black", weight=3];
597[label="rangeSize1 (Pos Zero) (Neg Zero) (null (Pos Zero : takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];597 -> 699[label="",style="solid", color="black", weight=3];
598[label="rangeSize1 (Neg (Succ zx3000)) (Pos zx310) False",fontsize=16,color="black",shape="box"];598 -> 700[label="",style="solid", color="black", weight=3];
6311[label="zx3100",fontsize=16,color="green",shape="box"];6312 -> 2241[label="",style="dashed", color="red", weight=0];
6312[label="Neg (Succ zx3000) + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];6312 -> 6371[label="",style="dashed", color="magenta", weight=3];
6313[label="zx3000",fontsize=16,color="green",shape="box"];6314[label="zx3000",fontsize=16,color="green",shape="box"];6315[label="zx3100",fontsize=16,color="green",shape="box"];6310[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat zx438 zx439 == GT))",fontsize=16,color="burlywood",shape="triangle"];11134[label="zx438/Succ zx4380",fontsize=10,color="white",style="solid",shape="box"];6310 -> 11134[label="",style="solid", color="burlywood", weight=9];
11134 -> 6372[label="",style="solid", color="burlywood", weight=3];
11135[label="zx438/Zero",fontsize=10,color="white",style="solid",shape="box"];6310 -> 11135[label="",style="solid", color="burlywood", weight=9];
11135 -> 6373[label="",style="solid", color="burlywood", weight=3];
5778[label="rangeSize1 (Neg (Succ zx353)) (Neg (Succ zx354)) (null (zx3630 : zx3631))",fontsize=16,color="black",shape="box"];5778 -> 5783[label="",style="solid", color="black", weight=3];
5779[label="rangeSize1 (Neg (Succ zx353)) (Neg (Succ zx354)) (null [])",fontsize=16,color="black",shape="box"];5779 -> 5784[label="",style="solid", color="black", weight=3];
603[label="rangeSize1 (Neg (Succ zx3000)) (Neg Zero) (null (takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx3000)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];603 -> 705[label="",style="solid", color="black", weight=3];
604[label="rangeSize1 (Neg Zero) (Pos (Succ zx3100)) (null (Neg Zero : takeWhile (flip (<=) (Pos (Succ zx3100))) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];604 -> 706[label="",style="solid", color="black", weight=3];
605[label="rangeSize1 (Neg Zero) (Pos Zero) (null (Neg Zero : takeWhile (flip (<=) (Pos Zero)) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];605 -> 707[label="",style="solid", color="black", weight=3];
606[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null (takeWhile1 (flip (<=) (Neg (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];606 -> 708[label="",style="solid", color="black", weight=3];
607[label="rangeSize1 (Neg Zero) (Neg Zero) (null (Neg Zero : takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];607 -> 709[label="",style="solid", color="black", weight=3];
608[label="rangeSize1 zx30 LT (null ((++) range40 LT (compare LT zx30 /= LT) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];608 -> 710[label="",style="solid", color="black", weight=3];
609[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (GT == LT) && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];609 -> 711[label="",style="solid", color="black", weight=3];
610[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (GT == LT) && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];610 -> 712[label="",style="solid", color="black", weight=3];
611[label="rangeSize1 zx30 False (null ((++) range00 False (compare False zx30 /= LT) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];611 -> 713[label="",style="solid", color="black", weight=3];
612[label="rangeSize1 zx30 True (null ((++) range00 False (not (GT == LT) && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];612 -> 714[label="",style="solid", color="black", weight=3];
623[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer zx3000) (numericEnumFrom $! Integer zx3000 + fromInt (Pos (Succ Zero))) (not (compare (Integer zx3000) (Integer zx3100) == GT))",fontsize=16,color="black",shape="box"];623 -> 723[label="",style="solid", color="black", weight=3];
624[label="(++) range40 LT (not (compare2 zx310 LT (zx310 == LT) == LT) && LT >= zx300) foldr (++) [] (map (range4 zx310 zx300) (EQ : GT : []))",fontsize=16,color="burlywood",shape="box"];11136[label="zx310/LT",fontsize=10,color="white",style="solid",shape="box"];624 -> 11136[label="",style="solid", color="burlywood", weight=9];
11136 -> 724[label="",style="solid", color="burlywood", weight=3];
11137[label="zx310/EQ",fontsize=10,color="white",style="solid",shape="box"];624 -> 11137[label="",style="solid", color="burlywood", weight=9];
11137 -> 725[label="",style="solid", color="burlywood", weight=3];
11138[label="zx310/GT",fontsize=10,color="white",style="solid",shape="box"];624 -> 11138[label="",style="solid", color="burlywood", weight=9];
11138 -> 726[label="",style="solid", color="burlywood", weight=3];
625[label="(++) range00 False (not (compare2 zx310 False (zx310 == False) == LT) && False >= zx300) foldr (++) [] (map (range0 zx310 zx300) (True : []))",fontsize=16,color="burlywood",shape="box"];11139[label="zx310/False",fontsize=10,color="white",style="solid",shape="box"];625 -> 11139[label="",style="solid", color="burlywood", weight=9];
11139 -> 727[label="",style="solid", color="burlywood", weight=3];
11140[label="zx310/True",fontsize=10,color="white",style="solid",shape="box"];625 -> 11140[label="",style="solid", color="burlywood", weight=9];
11140 -> 728[label="",style="solid", color="burlywood", weight=3];
1261[label="concat . map (range2 zx420 zx38 zx39)",fontsize=16,color="black",shape="box"];1261 -> 1305[label="",style="solid", color="black", weight=3];
1262 -> 1115[label="",style="dashed", color="red", weight=0];
1262[label="zx1051 ++ zx88",fontsize=16,color="magenta"];1262 -> 1306[label="",style="dashed", color="magenta", weight=3];
1000[label="zx13\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1001[label="zx16\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1002[label="zx13\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1003[label="zx16\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1004[label="zx13",fontsize=16,color="green",shape="box"];1005[label="zx16",fontsize=16,color="green",shape="box"];1006[label="zx13",fontsize=16,color="green",shape="box"];1007[label="zx16",fontsize=16,color="green",shape="box"];1008[label="zx13",fontsize=16,color="green",shape="box"];1009[label="zx16",fontsize=16,color="green",shape="box"];1010[label="zx13",fontsize=16,color="green",shape="box"];1011[label="zx16",fontsize=16,color="green",shape="box"];1012[label="zx13",fontsize=16,color="green",shape="box"];1013[label="zx16",fontsize=16,color="green",shape="box"];1014[label="zx13",fontsize=16,color="green",shape="box"];1015[label="zx16",fontsize=16,color="green",shape="box"];1016[label="foldr (++) [] (range2 zx101 zx102 zx103 zx1040 : map (range2 zx101 zx102 zx103) zx1041)",fontsize=16,color="black",shape="box"];1016 -> 1113[label="",style="solid", color="black", weight=3];
1017 -> 452[label="",style="dashed", color="red", weight=0];
1017[label="foldr (++) [] []",fontsize=16,color="magenta"];1400[label="index (zx64,zx67) zx67 + rangeSize (zx64,zx67) * (index (zx63,zx66) zx66 + rangeSize (zx63,zx66) * index (zx62,zx65) zx65)\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="triangle"];1400 -> 1508[label="",style="solid", color="black", weight=3];
1506[label="concat . map (range5 zx490)",fontsize=16,color="black",shape="box"];1506 -> 1622[label="",style="solid", color="black", weight=3];
1507 -> 1291[label="",style="dashed", color="red", weight=0];
1507[label="zx1261 ++ zx89",fontsize=16,color="magenta"];1507 -> 1623[label="",style="dashed", color="magenta", weight=3];
1263[label="zx26\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1264[label="zx28\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1265[label="zx26\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1266[label="zx28\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1267[label="zx26",fontsize=16,color="green",shape="box"];1268[label="zx28",fontsize=16,color="green",shape="box"];1269[label="zx26",fontsize=16,color="green",shape="box"];1270[label="zx28",fontsize=16,color="green",shape="box"];1271[label="zx26",fontsize=16,color="green",shape="box"];1272[label="zx28",fontsize=16,color="green",shape="box"];1273[label="zx26",fontsize=16,color="green",shape="box"];1274[label="zx28",fontsize=16,color="green",shape="box"];1275[label="zx26",fontsize=16,color="green",shape="box"];1276[label="zx28",fontsize=16,color="green",shape="box"];1277[label="zx26",fontsize=16,color="green",shape="box"];1278[label="zx28",fontsize=16,color="green",shape="box"];1279[label="foldr (++) [] (range5 zx109 zx1100 : map (range5 zx109) zx1101)",fontsize=16,color="black",shape="box"];1279 -> 1307[label="",style="solid", color="black", weight=3];
1280 -> 470[label="",style="dashed", color="red", weight=0];
1280[label="foldr (++) [] []",fontsize=16,color="magenta"];1401[label="index (zx82,zx84) zx84 + rangeSize (zx82,zx84) * index (zx81,zx83) zx83\n  Ix a  Ix b",fontsize=16,color="black",shape="triangle"];1401 -> 1509[label="",style="solid", color="black", weight=3];
5984[label="zx31000",fontsize=16,color="green",shape="box"];5985[label="zx30000",fontsize=16,color="green",shape="box"];5986 -> 6518[label="",style="dashed", color="red", weight=0];
5986[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx30000 zx31000 == GT))",fontsize=16,color="magenta"];5986 -> 6519[label="",style="dashed", color="magenta", weight=3];
5986 -> 6520[label="",style="dashed", color="magenta", weight=3];
5986 -> 6521[label="",style="dashed", color="magenta", weight=3];
5986 -> 6522[label="",style="dashed", color="magenta", weight=3];
5983[label="rangeSize1 (Integer (Pos (Succ zx380))) (Integer (Pos (Succ zx381))) (null zx397)",fontsize=16,color="burlywood",shape="triangle"];11146[label="zx397/zx3970 : zx3971",fontsize=10,color="white",style="solid",shape="box"];5983 -> 11146[label="",style="solid", color="burlywood", weight=9];
11146 -> 5996[label="",style="solid", color="burlywood", weight=3];
11147[label="zx397/[]",fontsize=10,color="white",style="solid",shape="box"];5983 -> 11147[label="",style="solid", color="burlywood", weight=9];
11147 -> 5997[label="",style="solid", color="burlywood", weight=3];
664[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];664 -> 919[label="",style="solid", color="black", weight=3];
665[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile0 (flip (<=) (Integer (Neg zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];665 -> 920[label="",style="solid", color="black", weight=3];
666[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];666 -> 921[label="",style="solid", color="black", weight=3];
667[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];667 -> 922[label="",style="solid", color="black", weight=3];
668[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];668 -> 923[label="",style="solid", color="black", weight=3];
669[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];669 -> 924[label="",style="solid", color="black", weight=3];
670[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (null (Integer (Neg (Succ zx30000)) : takeWhile (flip (<=) (Integer (Pos zx3100))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];670 -> 925[label="",style="solid", color="black", weight=3];
5911[label="zx31000",fontsize=16,color="green",shape="box"];5912[label="zx30000",fontsize=16,color="green",shape="box"];5913[label="zx31000",fontsize=16,color="green",shape="box"];5914[label="zx30000",fontsize=16,color="green",shape="box"];5910[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx387 zx388 == GT))))",fontsize=16,color="burlywood",shape="triangle"];11148[label="zx387/Succ zx3870",fontsize=10,color="white",style="solid",shape="box"];5910 -> 11148[label="",style="solid", color="burlywood", weight=9];
11148 -> 5951[label="",style="solid", color="burlywood", weight=3];
11149[label="zx387/Zero",fontsize=10,color="white",style="solid",shape="box"];5910 -> 11149[label="",style="solid", color="burlywood", weight=9];
11149 -> 5952[label="",style="solid", color="burlywood", weight=3];
673[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="box"];673 -> 930[label="",style="solid", color="black", weight=3];
674[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];674 -> 931[label="",style="solid", color="black", weight=3];
675[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];675 -> 932[label="",style="solid", color="black", weight=3];
676[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];676 -> 933[label="",style="solid", color="black", weight=3];
677[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];677 -> 934[label="",style="solid", color="black", weight=3];
678[label="takeWhile1 (flip (<=) (Pos zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx30000) zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11150[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];678 -> 11150[label="",style="solid", color="burlywood", weight=9];
11150 -> 935[label="",style="solid", color="burlywood", weight=3];
11151[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];678 -> 11151[label="",style="solid", color="burlywood", weight=9];
11151 -> 936[label="",style="solid", color="burlywood", weight=3];
679[label="takeWhile1 (flip (<=) (Neg zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];679 -> 937[label="",style="solid", color="black", weight=3];
680[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ zx31000)) == GT))",fontsize=16,color="black",shape="box"];680 -> 938[label="",style="solid", color="black", weight=3];
681[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];681 -> 939[label="",style="solid", color="black", weight=3];
682[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg (Succ zx31000)) == GT))",fontsize=16,color="black",shape="box"];682 -> 940[label="",style="solid", color="black", weight=3];
683[label="takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];683 -> 941[label="",style="solid", color="black", weight=3];
684[label="takeWhile1 (flip (<=) (Pos zx3100)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];684 -> 942[label="",style="solid", color="black", weight=3];
685[label="takeWhile1 (flip (<=) (Neg zx3100)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx3100 (Succ zx30000) == GT))",fontsize=16,color="burlywood",shape="box"];11152[label="zx3100/Succ zx31000",fontsize=10,color="white",style="solid",shape="box"];685 -> 11152[label="",style="solid", color="burlywood", weight=9];
11152 -> 943[label="",style="solid", color="burlywood", weight=3];
11153[label="zx3100/Zero",fontsize=10,color="white",style="solid",shape="box"];685 -> 11153[label="",style="solid", color="burlywood", weight=9];
11153 -> 944[label="",style="solid", color="burlywood", weight=3];
686[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos (Succ zx31000)) == GT))",fontsize=16,color="black",shape="box"];686 -> 945[label="",style="solid", color="black", weight=3];
687[label="takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];687 -> 946[label="",style="solid", color="black", weight=3];
688[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg (Succ zx31000)) == GT))",fontsize=16,color="black",shape="box"];688 -> 947[label="",style="solid", color="black", weight=3];
689[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];689 -> 948[label="",style="solid", color="black", weight=3];
2155[label="zx31",fontsize=16,color="green",shape="box"];2156[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx13000)) (Pos zx1610) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2156 -> 2274[label="",style="solid", color="black", weight=3];
2157[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx13000)) (Neg zx1610) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2157 -> 2275[label="",style="solid", color="black", weight=3];
2158[label="zx31",fontsize=16,color="green",shape="box"];2159[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Pos zx1620) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11154[label="zx1620/Succ zx16200",fontsize=10,color="white",style="solid",shape="box"];2159 -> 11154[label="",style="solid", color="burlywood", weight=9];
11154 -> 2276[label="",style="solid", color="burlywood", weight=3];
11155[label="zx1620/Zero",fontsize=10,color="white",style="solid",shape="box"];2159 -> 11155[label="",style="solid", color="burlywood", weight=9];
11155 -> 2277[label="",style="solid", color="burlywood", weight=3];
2160[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Neg zx1620) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11156[label="zx1620/Succ zx16200",fontsize=10,color="white",style="solid",shape="box"];2160 -> 11156[label="",style="solid", color="burlywood", weight=9];
11156 -> 2278[label="",style="solid", color="burlywood", weight=3];
11157[label="zx1620/Zero",fontsize=10,color="white",style="solid",shape="box"];2160 -> 11157[label="",style="solid", color="burlywood", weight=9];
11157 -> 2279[label="",style="solid", color="burlywood", weight=3];
2161[label="zx31",fontsize=16,color="green",shape="box"];2162[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx13000)) (Pos zx1630) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2162 -> 2280[label="",style="solid", color="black", weight=3];
2163[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx13000)) (Neg zx1630) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2163 -> 2281[label="",style="solid", color="black", weight=3];
2164[label="zx31",fontsize=16,color="green",shape="box"];2165[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Pos zx1640) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11158[label="zx1640/Succ zx16400",fontsize=10,color="white",style="solid",shape="box"];2165 -> 11158[label="",style="solid", color="burlywood", weight=9];
11158 -> 2282[label="",style="solid", color="burlywood", weight=3];
11159[label="zx1640/Zero",fontsize=10,color="white",style="solid",shape="box"];2165 -> 11159[label="",style="solid", color="burlywood", weight=9];
11159 -> 2283[label="",style="solid", color="burlywood", weight=3];
2166[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Neg zx1640) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11160[label="zx1640/Succ zx16400",fontsize=10,color="white",style="solid",shape="box"];2166 -> 11160[label="",style="solid", color="burlywood", weight=9];
11160 -> 2284[label="",style="solid", color="burlywood", weight=3];
11161[label="zx1640/Zero",fontsize=10,color="white",style="solid",shape="box"];2166 -> 11161[label="",style="solid", color="burlywood", weight=9];
11161 -> 2285[label="",style="solid", color="burlywood", weight=3];
4176 -> 4010[label="",style="dashed", color="red", weight=0];
4176[label="primPlusNat zx24500 zx153000",fontsize=16,color="magenta"];4176 -> 4190[label="",style="dashed", color="magenta", weight=3];
4176 -> 4191[label="",style="dashed", color="magenta", weight=3];
6305[label="primPlusInt (Pos (Succ zx3000)) (fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];6305 -> 6374[label="",style="solid", color="black", weight=3];
6306[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat (Succ zx4320) zx433 == GT))",fontsize=16,color="burlywood",shape="box"];11163[label="zx433/Succ zx4330",fontsize=10,color="white",style="solid",shape="box"];6306 -> 11163[label="",style="solid", color="burlywood", weight=9];
11163 -> 6375[label="",style="solid", color="burlywood", weight=3];
11164[label="zx433/Zero",fontsize=10,color="white",style="solid",shape="box"];6306 -> 11164[label="",style="solid", color="burlywood", weight=9];
11164 -> 6376[label="",style="solid", color="burlywood", weight=3];
6307[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat Zero zx433 == GT))",fontsize=16,color="burlywood",shape="box"];11165[label="zx433/Succ zx4330",fontsize=10,color="white",style="solid",shape="box"];6307 -> 11165[label="",style="solid", color="burlywood", weight=9];
11165 -> 6377[label="",style="solid", color="burlywood", weight=3];
11166[label="zx433/Zero",fontsize=10,color="white",style="solid",shape="box"];6307 -> 11166[label="",style="solid", color="burlywood", weight=9];
11166 -> 6378[label="",style="solid", color="burlywood", weight=3];
4908[label="rangeSize1 (Pos (Succ zx291)) (Pos (Succ zx292)) False",fontsize=16,color="black",shape="box"];4908 -> 4931[label="",style="solid", color="black", weight=3];
4909[label="rangeSize1 (Pos (Succ zx291)) (Pos (Succ zx292)) True",fontsize=16,color="black",shape="box"];4909 -> 4932[label="",style="solid", color="black", weight=3];
694[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) (null (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];694 -> 966[label="",style="solid", color="black", weight=3];
695[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) (null [])",fontsize=16,color="black",shape="box"];695 -> 967[label="",style="solid", color="black", weight=3];
696[label="rangeSize1 (Pos Zero) (Pos (Succ zx3100)) (null (Pos Zero : takeWhile (flip (<=) (Pos (Succ zx3100))) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];696 -> 968[label="",style="solid", color="black", weight=3];
697[label="rangeSize1 (Pos Zero) (Pos Zero) False",fontsize=16,color="black",shape="box"];697 -> 969[label="",style="solid", color="black", weight=3];
698[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) (null (takeWhile0 (flip (<=) (Neg (Succ zx3100))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];698 -> 970[label="",style="solid", color="black", weight=3];
699[label="rangeSize1 (Pos Zero) (Neg Zero) False",fontsize=16,color="black",shape="box"];699 -> 971[label="",style="solid", color="black", weight=3];
700[label="rangeSize0 (Neg (Succ zx3000)) (Pos zx310) otherwise",fontsize=16,color="black",shape="box"];700 -> 972[label="",style="solid", color="black", weight=3];
6371[label="zx3000",fontsize=16,color="green",shape="box"];2241[label="Neg (Succ zx30000) + fromInt (Pos (Succ Zero))",fontsize=16,color="black",shape="triangle"];2241 -> 2300[label="",style="solid", color="black", weight=3];
6372[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat (Succ zx4380) zx439 == GT))",fontsize=16,color="burlywood",shape="box"];11167[label="zx439/Succ zx4390",fontsize=10,color="white",style="solid",shape="box"];6372 -> 11167[label="",style="solid", color="burlywood", weight=9];
11167 -> 6408[label="",style="solid", color="burlywood", weight=3];
11168[label="zx439/Zero",fontsize=10,color="white",style="solid",shape="box"];6372 -> 11168[label="",style="solid", color="burlywood", weight=9];
11168 -> 6409[label="",style="solid", color="burlywood", weight=3];
6373[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat Zero zx439 == GT))",fontsize=16,color="burlywood",shape="box"];11169[label="zx439/Succ zx4390",fontsize=10,color="white",style="solid",shape="box"];6373 -> 11169[label="",style="solid", color="burlywood", weight=9];
11169 -> 6410[label="",style="solid", color="burlywood", weight=3];
11170[label="zx439/Zero",fontsize=10,color="white",style="solid",shape="box"];6373 -> 11170[label="",style="solid", color="burlywood", weight=9];
11170 -> 6411[label="",style="solid", color="burlywood", weight=3];
5783[label="rangeSize1 (Neg (Succ zx353)) (Neg (Succ zx354)) False",fontsize=16,color="black",shape="box"];5783 -> 5792[label="",style="solid", color="black", weight=3];
5784[label="rangeSize1 (Neg (Succ zx353)) (Neg (Succ zx354)) True",fontsize=16,color="black",shape="box"];5784 -> 5793[label="",style="solid", color="black", weight=3];
705[label="rangeSize1 (Neg (Succ zx3000)) (Neg Zero) (null (Neg (Succ zx3000) : takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Neg (Succ zx3000) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];705 -> 978[label="",style="solid", color="black", weight=3];
706[label="rangeSize1 (Neg Zero) (Pos (Succ zx3100)) False",fontsize=16,color="black",shape="box"];706 -> 979[label="",style="solid", color="black", weight=3];
707[label="rangeSize1 (Neg Zero) (Pos Zero) False",fontsize=16,color="black",shape="box"];707 -> 980[label="",style="solid", color="black", weight=3];
708[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null (takeWhile0 (flip (<=) (Neg (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];708 -> 981[label="",style="solid", color="black", weight=3];
709[label="rangeSize1 (Neg Zero) (Neg Zero) False",fontsize=16,color="black",shape="box"];709 -> 982[label="",style="solid", color="black", weight=3];
710[label="rangeSize1 zx30 LT (null ((++) range40 LT (not (compare LT zx30 == LT)) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];710 -> 983[label="",style="solid", color="black", weight=3];
711[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not False && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];711 -> 984[label="",style="solid", color="black", weight=3];
712[label="rangeSize1 zx30 GT (null ((++) range40 LT (not False && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];712 -> 985[label="",style="solid", color="black", weight=3];
713[label="rangeSize1 zx30 False (null ((++) range00 False (not (compare False zx30 == LT)) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];713 -> 986[label="",style="solid", color="black", weight=3];
714[label="rangeSize1 zx30 True (null ((++) range00 False (not False && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];714 -> 987[label="",style="solid", color="black", weight=3];
723[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer zx3000) (numericEnumFrom $! Integer zx3000 + fromInt (Pos (Succ Zero))) (not (primCmpInt zx3000 zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11171[label="zx3000/Pos zx30000",fontsize=10,color="white",style="solid",shape="box"];723 -> 11171[label="",style="solid", color="burlywood", weight=9];
11171 -> 988[label="",style="solid", color="burlywood", weight=3];
11172[label="zx3000/Neg zx30000",fontsize=10,color="white",style="solid",shape="box"];723 -> 11172[label="",style="solid", color="burlywood", weight=9];
11172 -> 989[label="",style="solid", color="burlywood", weight=3];
724[label="(++) range40 LT (not (compare2 LT LT (LT == LT) == LT) && LT >= zx300) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];724 -> 990[label="",style="solid", color="black", weight=3];
725[label="(++) range40 LT (not (compare2 EQ LT (EQ == LT) == LT) && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];725 -> 991[label="",style="solid", color="black", weight=3];
726[label="(++) range40 LT (not (compare2 GT LT (GT == LT) == LT) && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];726 -> 992[label="",style="solid", color="black", weight=3];
727[label="(++) range00 False (not (compare2 False False (False == False) == LT) && False >= zx300) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];727 -> 993[label="",style="solid", color="black", weight=3];
728[label="(++) range00 False (not (compare2 True False (True == False) == LT) && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];728 -> 994[label="",style="solid", color="black", weight=3];
1305[label="concat (map (range2 zx420 zx38 zx39) (range (zx40,zx41)))",fontsize=16,color="black",shape="box"];1305 -> 1402[label="",style="solid", color="black", weight=3];
1306[label="zx1051",fontsize=16,color="green",shape="box"];1113 -> 1115[label="",style="dashed", color="red", weight=0];
1113[label="(++) range2 zx101 zx102 zx103 zx1040 foldr (++) [] (map (range2 zx101 zx102 zx103) zx1041)",fontsize=16,color="magenta"];1113 -> 1123[label="",style="dashed", color="magenta", weight=3];
1113 -> 1124[label="",style="dashed", color="magenta", weight=3];
1508 -> 1643[label="",style="dashed", color="red", weight=0];
1508[label="primPlusInt (index (zx64,zx67) zx67) (rangeSize (zx64,zx67) * (index (zx63,zx66) zx66 + rangeSize (zx63,zx66) * index (zx62,zx65) zx65))\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];1508 -> 1644[label="",style="dashed", color="magenta", weight=3];
1508 -> 1645[label="",style="dashed", color="magenta", weight=3];
1508 -> 1646[label="",style="dashed", color="magenta", weight=3];
1508 -> 1647[label="",style="dashed", color="magenta", weight=3];
1622[label="concat (map (range5 zx490) (range (zx47,zx48)))",fontsize=16,color="black",shape="box"];1622 -> 1638[label="",style="solid", color="black", weight=3];
1623[label="zx1261",fontsize=16,color="green",shape="box"];1307 -> 1291[label="",style="dashed", color="red", weight=0];
1307[label="(++) range5 zx109 zx1100 foldr (++) [] (map (range5 zx109) zx1101)",fontsize=16,color="magenta"];1307 -> 1403[label="",style="dashed", color="magenta", weight=3];
1307 -> 1404[label="",style="dashed", color="magenta", weight=3];
1509 -> 1643[label="",style="dashed", color="red", weight=0];
1509[label="primPlusInt (index (zx82,zx84) zx84) (rangeSize (zx82,zx84) * index (zx81,zx83) zx83)\n  Ix a  Ix b",fontsize=16,color="magenta"];1509 -> 1648[label="",style="dashed", color="magenta", weight=3];
1509 -> 1649[label="",style="dashed", color="magenta", weight=3];
1509 -> 1650[label="",style="dashed", color="magenta", weight=3];
1509 -> 1651[label="",style="dashed", color="magenta", weight=3];
6519[label="zx30000",fontsize=16,color="green",shape="box"];6520[label="zx31000",fontsize=16,color="green",shape="box"];6521[label="zx30000",fontsize=16,color="green",shape="box"];6522[label="zx31000",fontsize=16,color="green",shape="box"];6518[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx446 zx447 == GT))",fontsize=16,color="burlywood",shape="triangle"];11177[label="zx446/Succ zx4460",fontsize=10,color="white",style="solid",shape="box"];6518 -> 11177[label="",style="solid", color="burlywood", weight=9];
11177 -> 6563[label="",style="solid", color="burlywood", weight=3];
11178[label="zx446/Zero",fontsize=10,color="white",style="solid",shape="box"];6518 -> 11178[label="",style="solid", color="burlywood", weight=9];
11178 -> 6564[label="",style="solid", color="burlywood", weight=3];
5996[label="rangeSize1 (Integer (Pos (Succ zx380))) (Integer (Pos (Succ zx381))) (null (zx3970 : zx3971))",fontsize=16,color="black",shape="box"];5996 -> 6006[label="",style="solid", color="black", weight=3];
5997[label="rangeSize1 (Integer (Pos (Succ zx380))) (Integer (Pos (Succ zx381))) (null [])",fontsize=16,color="black",shape="box"];5997 -> 6007[label="",style="solid", color="black", weight=3];
919[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) (null (takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];919 -> 1024[label="",style="solid", color="black", weight=3];
920[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) (null (takeWhile0 (flip (<=) (Integer (Neg zx3100))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];920 -> 1025[label="",style="solid", color="black", weight=3];
921[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Pos (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];921 -> 1026[label="",style="solid", color="black", weight=3];
922[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos Zero)) (null (Integer (Pos Zero) : takeWhile (flip (<=) (Integer (Pos Zero))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];922 -> 1027[label="",style="solid", color="black", weight=3];
923[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile0 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];923 -> 1028[label="",style="solid", color="black", weight=3];
924[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg Zero)) (null (Integer (Pos Zero) : takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];924 -> 1029[label="",style="solid", color="black", weight=3];
925[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) False",fontsize=16,color="black",shape="box"];925 -> 1030[label="",style="solid", color="black", weight=3];
5951[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3870) zx388 == GT))))",fontsize=16,color="burlywood",shape="box"];11179[label="zx388/Succ zx3880",fontsize=10,color="white",style="solid",shape="box"];5951 -> 11179[label="",style="solid", color="burlywood", weight=9];
11179 -> 5963[label="",style="solid", color="burlywood", weight=3];
11180[label="zx388/Zero",fontsize=10,color="white",style="solid",shape="box"];5951 -> 11180[label="",style="solid", color="burlywood", weight=9];
11180 -> 5964[label="",style="solid", color="burlywood", weight=3];
5952[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero zx388 == GT))))",fontsize=16,color="burlywood",shape="box"];11181[label="zx388/Succ zx3880",fontsize=10,color="white",style="solid",shape="box"];5952 -> 11181[label="",style="solid", color="burlywood", weight=9];
11181 -> 5965[label="",style="solid", color="burlywood", weight=3];
11182[label="zx388/Zero",fontsize=10,color="white",style="solid",shape="box"];5952 -> 11182[label="",style="solid", color="burlywood", weight=9];
11182 -> 5966[label="",style="solid", color="burlywood", weight=3];
930[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) (null (takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx30000))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];930 -> 1035[label="",style="solid", color="black", weight=3];
931[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) (null (Integer (Neg Zero) : takeWhile (flip (<=) (Integer (Pos (Succ zx31000)))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];931 -> 1036[label="",style="solid", color="black", weight=3];
932[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos Zero)) (null (Integer (Neg Zero) : takeWhile (flip (<=) (Integer (Pos Zero))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];932 -> 1037[label="",style="solid", color="black", weight=3];
933[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];933 -> 1038[label="",style="solid", color="black", weight=3];
934[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg Zero)) (null (Integer (Neg Zero) : takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];934 -> 1039[label="",style="solid", color="black", weight=3];
935[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx30000) (Succ zx31000) == GT))",fontsize=16,color="black",shape="box"];935 -> 1040[label="",style="solid", color="black", weight=3];
936[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx30000) Zero == GT))",fontsize=16,color="black",shape="box"];936 -> 1041[label="",style="solid", color="black", weight=3];
937[label="takeWhile1 (flip (<=) (Neg zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];937 -> 1042[label="",style="solid", color="black", weight=3];
938[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx31000) == GT))",fontsize=16,color="black",shape="box"];938 -> 1043[label="",style="solid", color="black", weight=3];
939[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];939 -> 1044[label="",style="solid", color="black", weight=3];
940[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];940 -> 1045[label="",style="solid", color="black", weight=3];
941[label="takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];941 -> 1046[label="",style="solid", color="black", weight=3];
942[label="takeWhile1 (flip (<=) (Pos zx3100)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];942 -> 1047[label="",style="solid", color="black", weight=3];
943[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx31000) (Succ zx30000) == GT))",fontsize=16,color="black",shape="box"];943 -> 1048[label="",style="solid", color="black", weight=3];
944[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx30000) == GT))",fontsize=16,color="black",shape="box"];944 -> 1049[label="",style="solid", color="black", weight=3];
945[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];945 -> 1050[label="",style="solid", color="black", weight=3];
946[label="takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];946 -> 1051[label="",style="solid", color="black", weight=3];
947[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx31000) Zero == GT))",fontsize=16,color="black",shape="box"];947 -> 1052[label="",style="solid", color="black", weight=3];
948[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];948 -> 1053[label="",style="solid", color="black", weight=3];
2274[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx13000) zx1610 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="triangle"];11183[label="zx1610/Succ zx16100",fontsize=10,color="white",style="solid",shape="box"];2274 -> 11183[label="",style="solid", color="burlywood", weight=9];
11183 -> 2305[label="",style="solid", color="burlywood", weight=3];
11184[label="zx1610/Zero",fontsize=10,color="white",style="solid",shape="box"];2274 -> 11184[label="",style="solid", color="burlywood", weight=9];
11184 -> 2306[label="",style="solid", color="burlywood", weight=3];
2275[label="index8 zx30 zx31 zx31 (not (GT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="triangle"];2275 -> 2307[label="",style="solid", color="black", weight=3];
2276[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Pos (Succ zx16200)) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2276 -> 2308[label="",style="solid", color="black", weight=3];
2277[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Pos Zero) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2277 -> 2309[label="",style="solid", color="black", weight=3];
2278[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Neg (Succ zx16200)) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2278 -> 2310[label="",style="solid", color="black", weight=3];
2279[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Neg Zero) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2279 -> 2311[label="",style="solid", color="black", weight=3];
2280[label="index8 zx30 zx31 zx31 (not (LT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="triangle"];2280 -> 2312[label="",style="solid", color="black", weight=3];
2281[label="index8 zx30 zx31 zx31 (not (primCmpNat zx1630 (Succ zx13000) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="triangle"];11185[label="zx1630/Succ zx16300",fontsize=10,color="white",style="solid",shape="box"];2281 -> 11185[label="",style="solid", color="burlywood", weight=9];
11185 -> 2313[label="",style="solid", color="burlywood", weight=3];
11186[label="zx1630/Zero",fontsize=10,color="white",style="solid",shape="box"];2281 -> 11186[label="",style="solid", color="burlywood", weight=9];
11186 -> 2314[label="",style="solid", color="burlywood", weight=3];
2282[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Pos (Succ zx16400)) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2282 -> 2315[label="",style="solid", color="black", weight=3];
2283[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Pos Zero) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2283 -> 2316[label="",style="solid", color="black", weight=3];
2284[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Neg (Succ zx16400)) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2284 -> 2317[label="",style="solid", color="black", weight=3];
2285[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Neg Zero) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2285 -> 2318[label="",style="solid", color="black", weight=3];
4190[label="zx153000",fontsize=16,color="green",shape="box"];4191[label="zx24500",fontsize=16,color="green",shape="box"];6374 -> 1395[label="",style="dashed", color="red", weight=0];
6374[label="primPlusInt (Pos (Succ zx3000)) (Pos (Succ Zero))",fontsize=16,color="magenta"];6374 -> 6412[label="",style="dashed", color="magenta", weight=3];
6375[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat (Succ zx4320) (Succ zx4330) == GT))",fontsize=16,color="black",shape="box"];6375 -> 6413[label="",style="solid", color="black", weight=3];
6376[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat (Succ zx4320) Zero == GT))",fontsize=16,color="black",shape="box"];6376 -> 6414[label="",style="solid", color="black", weight=3];
6377[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat Zero (Succ zx4330) == GT))",fontsize=16,color="black",shape="box"];6377 -> 6415[label="",style="solid", color="black", weight=3];
6378[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];6378 -> 6416[label="",style="solid", color="black", weight=3];
4931[label="rangeSize0 (Pos (Succ zx291)) (Pos (Succ zx292)) otherwise",fontsize=16,color="black",shape="box"];4931 -> 5016[label="",style="solid", color="black", weight=3];
4932[label="Pos Zero",fontsize=16,color="green",shape="box"];966[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) (null (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ zx3000)) (numericEnumFrom $! Pos (Succ zx3000) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];966 -> 1075[label="",style="solid", color="black", weight=3];
967[label="rangeSize1 (Pos (Succ zx3000)) (Neg zx310) True",fontsize=16,color="black",shape="box"];967 -> 1076[label="",style="solid", color="black", weight=3];
968[label="rangeSize1 (Pos Zero) (Pos (Succ zx3100)) False",fontsize=16,color="black",shape="box"];968 -> 1077[label="",style="solid", color="black", weight=3];
969[label="rangeSize0 (Pos Zero) (Pos Zero) otherwise",fontsize=16,color="black",shape="box"];969 -> 1078[label="",style="solid", color="black", weight=3];
970[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) (null [])",fontsize=16,color="black",shape="box"];970 -> 1079[label="",style="solid", color="black", weight=3];
971[label="rangeSize0 (Pos Zero) (Neg Zero) otherwise",fontsize=16,color="black",shape="box"];971 -> 1080[label="",style="solid", color="black", weight=3];
972[label="rangeSize0 (Neg (Succ zx3000)) (Pos zx310) True",fontsize=16,color="black",shape="box"];972 -> 1081[label="",style="solid", color="black", weight=3];
2300[label="primPlusInt (Neg (Succ zx30000)) (fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2300 -> 2340[label="",style="solid", color="black", weight=3];
6408[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat (Succ zx4380) (Succ zx4390) == GT))",fontsize=16,color="black",shape="box"];6408 -> 6565[label="",style="solid", color="black", weight=3];
6409[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat (Succ zx4380) Zero == GT))",fontsize=16,color="black",shape="box"];6409 -> 6566[label="",style="solid", color="black", weight=3];
6410[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat Zero (Succ zx4390) == GT))",fontsize=16,color="black",shape="box"];6410 -> 6567[label="",style="solid", color="black", weight=3];
6411[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];6411 -> 6568[label="",style="solid", color="black", weight=3];
5792[label="rangeSize0 (Neg (Succ zx353)) (Neg (Succ zx354)) otherwise",fontsize=16,color="black",shape="box"];5792 -> 5797[label="",style="solid", color="black", weight=3];
5793[label="Pos Zero",fontsize=16,color="green",shape="box"];978[label="rangeSize1 (Neg (Succ zx3000)) (Neg Zero) False",fontsize=16,color="black",shape="box"];978 -> 1089[label="",style="solid", color="black", weight=3];
979[label="rangeSize0 (Neg Zero) (Pos (Succ zx3100)) otherwise",fontsize=16,color="black",shape="box"];979 -> 1090[label="",style="solid", color="black", weight=3];
980[label="rangeSize0 (Neg Zero) (Pos Zero) otherwise",fontsize=16,color="black",shape="box"];980 -> 1091[label="",style="solid", color="black", weight=3];
981[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null (takeWhile0 (flip (<=) (Neg (Succ zx3100))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];981 -> 1092[label="",style="solid", color="black", weight=3];
982[label="rangeSize0 (Neg Zero) (Neg Zero) otherwise",fontsize=16,color="black",shape="box"];982 -> 1093[label="",style="solid", color="black", weight=3];
983[label="rangeSize1 zx30 LT (null ((++) range40 LT (not (compare3 LT zx30 == LT)) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];983 -> 1094[label="",style="solid", color="black", weight=3];
984[label="rangeSize1 zx30 EQ (null ((++) range40 LT (True && LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];984 -> 1095[label="",style="solid", color="black", weight=3];
985[label="rangeSize1 zx30 GT (null ((++) range40 LT (True && LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];985 -> 1096[label="",style="solid", color="black", weight=3];
986[label="rangeSize1 zx30 False (null ((++) range00 False (not (compare3 False zx30 == LT)) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="black",shape="box"];986 -> 1097[label="",style="solid", color="black", weight=3];
987[label="rangeSize1 zx30 True (null ((++) range00 False (True && False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];987 -> 1098[label="",style="solid", color="black", weight=3];
988[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer (Pos zx30000)) (numericEnumFrom $! Integer (Pos zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos zx30000) zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11188[label="zx30000/Succ zx300000",fontsize=10,color="white",style="solid",shape="box"];988 -> 11188[label="",style="solid", color="burlywood", weight=9];
11188 -> 1099[label="",style="solid", color="burlywood", weight=3];
11189[label="zx30000/Zero",fontsize=10,color="white",style="solid",shape="box"];988 -> 11189[label="",style="solid", color="burlywood", weight=9];
11189 -> 1100[label="",style="solid", color="burlywood", weight=3];
989[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer (Neg zx30000)) (numericEnumFrom $! Integer (Neg zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg zx30000) zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11190[label="zx30000/Succ zx300000",fontsize=10,color="white",style="solid",shape="box"];989 -> 11190[label="",style="solid", color="burlywood", weight=9];
11190 -> 1101[label="",style="solid", color="burlywood", weight=3];
11191[label="zx30000/Zero",fontsize=10,color="white",style="solid",shape="box"];989 -> 11191[label="",style="solid", color="burlywood", weight=9];
11191 -> 1102[label="",style="solid", color="burlywood", weight=3];
990[label="(++) range40 LT (not (compare2 LT LT True == LT) && LT >= zx300) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];990 -> 1103[label="",style="solid", color="black", weight=3];
991[label="(++) range40 LT (not (compare2 EQ LT False == LT) && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];991 -> 1104[label="",style="solid", color="black", weight=3];
992[label="(++) range40 LT (not (compare2 GT LT False == LT) && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];992 -> 1105[label="",style="solid", color="black", weight=3];
993[label="(++) range00 False (not (compare2 False False True == LT) && False >= zx300) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];993 -> 1106[label="",style="solid", color="black", weight=3];
994[label="(++) range00 False (not (compare2 True False False == LT) && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];994 -> 1107[label="",style="solid", color="black", weight=3];
1402 -> 894[label="",style="dashed", color="red", weight=0];
1402[label="foldr (++) [] (map (range2 zx420 zx38 zx39) (range (zx40,zx41)))",fontsize=16,color="magenta"];1402 -> 1510[label="",style="dashed", color="magenta", weight=3];
1402 -> 1511[label="",style="dashed", color="magenta", weight=3];
1402 -> 1512[label="",style="dashed", color="magenta", weight=3];
1402 -> 1513[label="",style="dashed", color="magenta", weight=3];
1123 -> 894[label="",style="dashed", color="red", weight=0];
1123[label="foldr (++) [] (map (range2 zx101 zx102 zx103) zx1041)",fontsize=16,color="magenta"];1123 -> 1138[label="",style="dashed", color="magenta", weight=3];
1124[label="range2 zx101 zx102 zx103 zx1040",fontsize=16,color="black",shape="box"];1124 -> 1139[label="",style="solid", color="black", weight=3];
1644[label="index (zx64,zx67) zx67\n  Ix a",fontsize=16,color="blue",shape="box"];11194[label="index :: ((@2) ((@3) a b c) ((@3) a b c)) -> ((@3) a b c) -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11194[label="",style="solid", color="blue", weight=9];
11194 -> 1661[label="",style="solid", color="blue", weight=3];
11195[label="index :: ((@2) ((@2) a b) ((@2) a b)) -> ((@2) a b) -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11195[label="",style="solid", color="blue", weight=9];
11195 -> 1662[label="",style="solid", color="blue", weight=3];
11196[label="index :: ((@2) Integer Integer) -> Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11196[label="",style="solid", color="blue", weight=9];
11196 -> 1663[label="",style="solid", color="blue", weight=3];
11197[label="index :: ((@2) () ()) -> () -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11197[label="",style="solid", color="blue", weight=9];
11197 -> 1664[label="",style="solid", color="blue", weight=3];
11198[label="index :: ((@2) Char Char) -> Char -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11198[label="",style="solid", color="blue", weight=9];
11198 -> 1665[label="",style="solid", color="blue", weight=3];
11199[label="index :: ((@2) Int Int) -> Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11199[label="",style="solid", color="blue", weight=9];
11199 -> 1666[label="",style="solid", color="blue", weight=3];
11200[label="index :: ((@2) Ordering Ordering) -> Ordering -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11200[label="",style="solid", color="blue", weight=9];
11200 -> 1667[label="",style="solid", color="blue", weight=3];
11201[label="index :: ((@2) Bool Bool) -> Bool -> Int",fontsize=10,color="white",style="solid",shape="box"];1644 -> 11201[label="",style="solid", color="blue", weight=9];
11201 -> 1668[label="",style="solid", color="blue", weight=3];
1645[label="zx67\n  Ix a",fontsize=16,color="green",shape="box"];1646 -> 1401[label="",style="dashed", color="red", weight=0];
1646[label="index (zx63,zx66) zx66 + rangeSize (zx63,zx66) * index (zx62,zx65) zx65\n  Ix a  Ix b",fontsize=16,color="magenta"];1646 -> 1669[label="",style="dashed", color="magenta", weight=3];
1646 -> 1670[label="",style="dashed", color="magenta", weight=3];
1646 -> 1671[label="",style="dashed", color="magenta", weight=3];
1646 -> 1672[label="",style="dashed", color="magenta", weight=3];
1647[label="zx64\n  Ix a",fontsize=16,color="green",shape="box"];1643[label="primPlusInt zx136 (rangeSize (zx137,zx138) * zx139)\n  Ix a",fontsize=16,color="burlywood",shape="triangle"];11203[label="zx136/Pos zx1360",fontsize=10,color="white",style="solid",shape="box"];1643 -> 11203[label="",style="solid", color="burlywood", weight=9];
11203 -> 1673[label="",style="solid", color="burlywood", weight=3];
11204[label="zx136/Neg zx1360",fontsize=10,color="white",style="solid",shape="box"];1643 -> 11204[label="",style="solid", color="burlywood", weight=9];
11204 -> 1674[label="",style="solid", color="burlywood", weight=3];
1638 -> 1235[label="",style="dashed", color="red", weight=0];
1638[label="foldr (++) [] (map (range5 zx490) (range (zx47,zx48)))",fontsize=16,color="magenta"];1638 -> 1675[label="",style="dashed", color="magenta", weight=3];
1638 -> 1676[label="",style="dashed", color="magenta", weight=3];
1403[label="range5 zx109 zx1100",fontsize=16,color="black",shape="box"];1403 -> 1514[label="",style="solid", color="black", weight=3];
1404 -> 1235[label="",style="dashed", color="red", weight=0];
1404[label="foldr (++) [] (map (range5 zx109) zx1101)",fontsize=16,color="magenta"];1404 -> 1515[label="",style="dashed", color="magenta", weight=3];
1648[label="index (zx82,zx84) zx84\n  Ix a",fontsize=16,color="blue",shape="box"];11207[label="index :: ((@2) ((@3) a b c) ((@3) a b c)) -> ((@3) a b c) -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11207[label="",style="solid", color="blue", weight=9];
11207 -> 1677[label="",style="solid", color="blue", weight=3];
11208[label="index :: ((@2) ((@2) a b) ((@2) a b)) -> ((@2) a b) -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11208[label="",style="solid", color="blue", weight=9];
11208 -> 1678[label="",style="solid", color="blue", weight=3];
11209[label="index :: ((@2) Integer Integer) -> Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11209[label="",style="solid", color="blue", weight=9];
11209 -> 1679[label="",style="solid", color="blue", weight=3];
11210[label="index :: ((@2) () ()) -> () -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11210[label="",style="solid", color="blue", weight=9];
11210 -> 1680[label="",style="solid", color="blue", weight=3];
11211[label="index :: ((@2) Char Char) -> Char -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11211[label="",style="solid", color="blue", weight=9];
11211 -> 1681[label="",style="solid", color="blue", weight=3];
11212[label="index :: ((@2) Int Int) -> Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11212[label="",style="solid", color="blue", weight=9];
11212 -> 1682[label="",style="solid", color="blue", weight=3];
11213[label="index :: ((@2) Ordering Ordering) -> Ordering -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11213[label="",style="solid", color="blue", weight=9];
11213 -> 1683[label="",style="solid", color="blue", weight=3];
11214[label="index :: ((@2) Bool Bool) -> Bool -> Int",fontsize=10,color="white",style="solid",shape="box"];1648 -> 11214[label="",style="solid", color="blue", weight=9];
11214 -> 1684[label="",style="solid", color="blue", weight=3];
1649[label="zx84\n  Ix a",fontsize=16,color="green",shape="box"];1650[label="index (zx81,zx83) zx83\n  Ix a",fontsize=16,color="blue",shape="box"];11215[label="index :: ((@2) ((@3) a b c) ((@3) a b c)) -> ((@3) a b c) -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11215[label="",style="solid", color="blue", weight=9];
11215 -> 1685[label="",style="solid", color="blue", weight=3];
11216[label="index :: ((@2) ((@2) a b) ((@2) a b)) -> ((@2) a b) -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11216[label="",style="solid", color="blue", weight=9];
11216 -> 1686[label="",style="solid", color="blue", weight=3];
11217[label="index :: ((@2) Integer Integer) -> Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11217[label="",style="solid", color="blue", weight=9];
11217 -> 1687[label="",style="solid", color="blue", weight=3];
11218[label="index :: ((@2) () ()) -> () -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11218[label="",style="solid", color="blue", weight=9];
11218 -> 1688[label="",style="solid", color="blue", weight=3];
11219[label="index :: ((@2) Char Char) -> Char -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11219[label="",style="solid", color="blue", weight=9];
11219 -> 1689[label="",style="solid", color="blue", weight=3];
11220[label="index :: ((@2) Int Int) -> Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11220[label="",style="solid", color="blue", weight=9];
11220 -> 1690[label="",style="solid", color="blue", weight=3];
11221[label="index :: ((@2) Ordering Ordering) -> Ordering -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11221[label="",style="solid", color="blue", weight=9];
11221 -> 1691[label="",style="solid", color="blue", weight=3];
11222[label="index :: ((@2) Bool Bool) -> Bool -> Int",fontsize=10,color="white",style="solid",shape="box"];1650 -> 11222[label="",style="solid", color="blue", weight=9];
11222 -> 1692[label="",style="solid", color="blue", weight=3];
1651[label="zx82\n  Ix a",fontsize=16,color="green",shape="box"];6563[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx4460) zx447 == GT))",fontsize=16,color="burlywood",shape="box"];11223[label="zx447/Succ zx4470",fontsize=10,color="white",style="solid",shape="box"];6563 -> 11223[label="",style="solid", color="burlywood", weight=9];
11223 -> 6594[label="",style="solid", color="burlywood", weight=3];
11224[label="zx447/Zero",fontsize=10,color="white",style="solid",shape="box"];6563 -> 11224[label="",style="solid", color="burlywood", weight=9];
11224 -> 6595[label="",style="solid", color="burlywood", weight=3];
6564[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero zx447 == GT))",fontsize=16,color="burlywood",shape="box"];11225[label="zx447/Succ zx4470",fontsize=10,color="white",style="solid",shape="box"];6564 -> 11225[label="",style="solid", color="burlywood", weight=9];
11225 -> 6596[label="",style="solid", color="burlywood", weight=3];
11226[label="zx447/Zero",fontsize=10,color="white",style="solid",shape="box"];6564 -> 11226[label="",style="solid", color="burlywood", weight=9];
11226 -> 6597[label="",style="solid", color="burlywood", weight=3];
6006[label="rangeSize1 (Integer (Pos (Succ zx380))) (Integer (Pos (Succ zx381))) False",fontsize=16,color="black",shape="box"];6006 -> 6029[label="",style="solid", color="black", weight=3];
6007[label="rangeSize1 (Integer (Pos (Succ zx380))) (Integer (Pos (Succ zx381))) True",fontsize=16,color="black",shape="box"];6007 -> 6030[label="",style="solid", color="black", weight=3];
1024[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) (null (takeWhile0 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];1024 -> 1145[label="",style="solid", color="black", weight=3];
1025[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) (null [])",fontsize=16,color="black",shape="box"];1025 -> 1146[label="",style="solid", color="black", weight=3];
1026[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) (null (Integer (Pos Zero) : takeWhile (flip (<=) (Integer (Pos (Succ zx31000)))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];1026 -> 1147[label="",style="solid", color="black", weight=3];
1027[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos Zero)) False",fontsize=16,color="black",shape="box"];1027 -> 1148[label="",style="solid", color="black", weight=3];
1028[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile0 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];1028 -> 1149[label="",style="solid", color="black", weight=3];
1029[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg Zero)) False",fontsize=16,color="black",shape="box"];1029 -> 1150[label="",style="solid", color="black", weight=3];
1030[label="rangeSize0 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) otherwise",fontsize=16,color="black",shape="box"];1030 -> 1151[label="",style="solid", color="black", weight=3];
5963[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3870) (Succ zx3880) == GT))))",fontsize=16,color="black",shape="box"];5963 -> 5975[label="",style="solid", color="black", weight=3];
5964[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx3870) Zero == GT))))",fontsize=16,color="black",shape="box"];5964 -> 5976[label="",style="solid", color="black", weight=3];
5965[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx3880) == GT))))",fontsize=16,color="black",shape="box"];5965 -> 5977[label="",style="solid", color="black", weight=3];
5966[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero Zero == GT))))",fontsize=16,color="black",shape="box"];5966 -> 5978[label="",style="solid", color="black", weight=3];
1035[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) (null (Integer (Neg (Succ zx30000)) : takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Neg (Succ zx30000)) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];1035 -> 1157[label="",style="solid", color="black", weight=3];
1036[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) False",fontsize=16,color="black",shape="box"];1036 -> 1158[label="",style="solid", color="black", weight=3];
1037[label="rangeSize1 (Integer (Neg Zero)) (Integer (Pos Zero)) False",fontsize=16,color="black",shape="box"];1037 -> 1159[label="",style="solid", color="black", weight=3];
1038[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile0 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];1038 -> 1160[label="",style="solid", color="black", weight=3];
1039[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg Zero)) False",fontsize=16,color="black",shape="box"];1039 -> 1161[label="",style="solid", color="black", weight=3];
1040 -> 6244[label="",style="dashed", color="red", weight=0];
1040[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx30000 zx31000 == GT))",fontsize=16,color="magenta"];1040 -> 6250[label="",style="dashed", color="magenta", weight=3];
1040 -> 6251[label="",style="dashed", color="magenta", weight=3];
1040 -> 6252[label="",style="dashed", color="magenta", weight=3];
1040 -> 6253[label="",style="dashed", color="magenta", weight=3];
1040 -> 6254[label="",style="dashed", color="magenta", weight=3];
1041[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1041 -> 1164[label="",style="solid", color="black", weight=3];
1042[label="takeWhile1 (flip (<=) (Neg zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1042 -> 1165[label="",style="solid", color="black", weight=3];
1043[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1043 -> 1166[label="",style="solid", color="black", weight=3];
1044[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1044 -> 1167[label="",style="solid", color="black", weight=3];
1045[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1045 -> 1168[label="",style="solid", color="black", weight=3];
1046[label="takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1046 -> 1169[label="",style="solid", color="black", weight=3];
1047[label="takeWhile1 (flip (<=) (Pos zx3100)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1047 -> 1170[label="",style="solid", color="black", weight=3];
1048 -> 6310[label="",style="dashed", color="red", weight=0];
1048[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx31000 zx30000 == GT))",fontsize=16,color="magenta"];1048 -> 6316[label="",style="dashed", color="magenta", weight=3];
1048 -> 6317[label="",style="dashed", color="magenta", weight=3];
1048 -> 6318[label="",style="dashed", color="magenta", weight=3];
1048 -> 6319[label="",style="dashed", color="magenta", weight=3];
1048 -> 6320[label="",style="dashed", color="magenta", weight=3];
1049[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1049 -> 1173[label="",style="solid", color="black", weight=3];
1050[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1050 -> 1174[label="",style="solid", color="black", weight=3];
1051[label="takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1051 -> 1175[label="",style="solid", color="black", weight=3];
1052[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1052 -> 1176[label="",style="solid", color="black", weight=3];
1053[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1053 -> 1177[label="",style="solid", color="black", weight=3];
2305[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx13000) (Succ zx16100) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2305 -> 2345[label="",style="solid", color="black", weight=3];
2306[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx13000) Zero == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2306 -> 2346[label="",style="solid", color="black", weight=3];
2307[label="index8 zx30 zx31 zx31 (not True && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2307 -> 2347[label="",style="solid", color="black", weight=3];
2308 -> 2281[label="",style="dashed", color="red", weight=0];
2308[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero (Succ zx16200) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2308 -> 2348[label="",style="dashed", color="magenta", weight=3];
2308 -> 2349[label="",style="dashed", color="magenta", weight=3];
2309[label="index8 zx30 zx31 zx31 (not (EQ == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="triangle"];2309 -> 2350[label="",style="solid", color="black", weight=3];
2310 -> 2275[label="",style="dashed", color="red", weight=0];
2310[label="index8 zx30 zx31 zx31 (not (GT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2311 -> 2309[label="",style="dashed", color="red", weight=0];
2311[label="index8 zx30 zx31 zx31 (not (EQ == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2312[label="index8 zx30 zx31 zx31 (not False && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="triangle"];2312 -> 2351[label="",style="solid", color="black", weight=3];
2313[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx16300) (Succ zx13000) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2313 -> 2352[label="",style="solid", color="black", weight=3];
2314[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero (Succ zx13000) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2314 -> 2353[label="",style="solid", color="black", weight=3];
2315 -> 2280[label="",style="dashed", color="red", weight=0];
2315[label="index8 zx30 zx31 zx31 (not (LT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2316 -> 2309[label="",style="dashed", color="red", weight=0];
2316[label="index8 zx30 zx31 zx31 (not (EQ == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2317 -> 2274[label="",style="dashed", color="red", weight=0];
2317[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx16400) Zero == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2317 -> 2354[label="",style="dashed", color="magenta", weight=3];
2317 -> 2355[label="",style="dashed", color="magenta", weight=3];
2318 -> 2309[label="",style="dashed", color="red", weight=0];
2318[label="index8 zx30 zx31 zx31 (not (EQ == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];6412[label="Pos (Succ zx3000)",fontsize=16,color="green",shape="box"];6413 -> 6244[label="",style="dashed", color="red", weight=0];
6413[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (primCmpNat zx4320 zx4330 == GT))",fontsize=16,color="magenta"];6413 -> 6569[label="",style="dashed", color="magenta", weight=3];
6413 -> 6570[label="",style="dashed", color="magenta", weight=3];
6414[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (GT == GT))",fontsize=16,color="black",shape="box"];6414 -> 6571[label="",style="solid", color="black", weight=3];
6415[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (LT == GT))",fontsize=16,color="black",shape="box"];6415 -> 6572[label="",style="solid", color="black", weight=3];
6416[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not (EQ == GT))",fontsize=16,color="black",shape="box"];6416 -> 6573[label="",style="solid", color="black", weight=3];
5016[label="rangeSize0 (Pos (Succ zx291)) (Pos (Succ zx292)) True",fontsize=16,color="black",shape="box"];5016 -> 5120[label="",style="solid", color="black", weight=3];
1075[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) (null [])",fontsize=16,color="black",shape="box"];1075 -> 1196[label="",style="solid", color="black", weight=3];
1076[label="Pos Zero",fontsize=16,color="green",shape="box"];1077[label="rangeSize0 (Pos Zero) (Pos (Succ zx3100)) otherwise",fontsize=16,color="black",shape="box"];1077 -> 1197[label="",style="solid", color="black", weight=3];
1078[label="rangeSize0 (Pos Zero) (Pos Zero) True",fontsize=16,color="black",shape="box"];1078 -> 1198[label="",style="solid", color="black", weight=3];
1079[label="rangeSize1 (Pos Zero) (Neg (Succ zx3100)) True",fontsize=16,color="black",shape="box"];1079 -> 1199[label="",style="solid", color="black", weight=3];
1080[label="rangeSize0 (Pos Zero) (Neg Zero) True",fontsize=16,color="black",shape="box"];1080 -> 1200[label="",style="solid", color="black", weight=3];
1081 -> 1381[label="",style="dashed", color="red", weight=0];
1081[label="index (Neg (Succ zx3000),Pos zx310) (Pos zx310) + Pos (Succ Zero)",fontsize=16,color="magenta"];1081 -> 1386[label="",style="dashed", color="magenta", weight=3];
2340 -> 1395[label="",style="dashed", color="red", weight=0];
2340[label="primPlusInt (Neg (Succ zx30000)) (Pos (Succ Zero))",fontsize=16,color="magenta"];2340 -> 2563[label="",style="dashed", color="magenta", weight=3];
6565 -> 6310[label="",style="dashed", color="red", weight=0];
6565[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (primCmpNat zx4380 zx4390 == GT))",fontsize=16,color="magenta"];6565 -> 6598[label="",style="dashed", color="magenta", weight=3];
6565 -> 6599[label="",style="dashed", color="magenta", weight=3];
6566[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (GT == GT))",fontsize=16,color="black",shape="box"];6566 -> 6600[label="",style="solid", color="black", weight=3];
6567[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (LT == GT))",fontsize=16,color="black",shape="box"];6567 -> 6601[label="",style="solid", color="black", weight=3];
6568[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not (EQ == GT))",fontsize=16,color="black",shape="box"];6568 -> 6602[label="",style="solid", color="black", weight=3];
5797[label="rangeSize0 (Neg (Succ zx353)) (Neg (Succ zx354)) True",fontsize=16,color="black",shape="box"];5797 -> 5801[label="",style="solid", color="black", weight=3];
1089[label="rangeSize0 (Neg (Succ zx3000)) (Neg Zero) otherwise",fontsize=16,color="black",shape="box"];1089 -> 1209[label="",style="solid", color="black", weight=3];
1090[label="rangeSize0 (Neg Zero) (Pos (Succ zx3100)) True",fontsize=16,color="black",shape="box"];1090 -> 1210[label="",style="solid", color="black", weight=3];
1091[label="rangeSize0 (Neg Zero) (Pos Zero) True",fontsize=16,color="black",shape="box"];1091 -> 1211[label="",style="solid", color="black", weight=3];
1092[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) (null [])",fontsize=16,color="black",shape="box"];1092 -> 1212[label="",style="solid", color="black", weight=3];
1093[label="rangeSize0 (Neg Zero) (Neg Zero) True",fontsize=16,color="black",shape="box"];1093 -> 1213[label="",style="solid", color="black", weight=3];
1094[label="rangeSize1 zx30 LT (null ((++) range40 LT (not (compare2 LT zx30 (LT == zx30) == LT)) foldr (++) [] (map (range4 LT zx30) (EQ : GT : []))))",fontsize=16,color="burlywood",shape="box"];11240[label="zx30/LT",fontsize=10,color="white",style="solid",shape="box"];1094 -> 11240[label="",style="solid", color="burlywood", weight=9];
11240 -> 1214[label="",style="solid", color="burlywood", weight=3];
11241[label="zx30/EQ",fontsize=10,color="white",style="solid",shape="box"];1094 -> 11241[label="",style="solid", color="burlywood", weight=9];
11241 -> 1215[label="",style="solid", color="burlywood", weight=3];
11242[label="zx30/GT",fontsize=10,color="white",style="solid",shape="box"];1094 -> 11242[label="",style="solid", color="burlywood", weight=9];
11242 -> 1216[label="",style="solid", color="burlywood", weight=3];
1095[label="rangeSize1 zx30 EQ (null ((++) range40 LT (LT >= zx30) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1095 -> 1217[label="",style="solid", color="black", weight=3];
1096[label="rangeSize1 zx30 GT (null ((++) range40 LT (LT >= zx30) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1096 -> 1218[label="",style="solid", color="black", weight=3];
1097[label="rangeSize1 zx30 False (null ((++) range00 False (not (compare2 False zx30 (False == zx30) == LT)) foldr (++) [] (map (range0 False zx30) (True : []))))",fontsize=16,color="burlywood",shape="box"];11243[label="zx30/False",fontsize=10,color="white",style="solid",shape="box"];1097 -> 11243[label="",style="solid", color="burlywood", weight=9];
11243 -> 1219[label="",style="solid", color="burlywood", weight=3];
11244[label="zx30/True",fontsize=10,color="white",style="solid",shape="box"];1097 -> 11244[label="",style="solid", color="burlywood", weight=9];
11244 -> 1220[label="",style="solid", color="burlywood", weight=3];
1098[label="rangeSize1 zx30 True (null ((++) range00 False (False >= zx30) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];1098 -> 1221[label="",style="solid", color="black", weight=3];
1099[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx300000)) zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11245[label="zx3100/Pos zx31000",fontsize=10,color="white",style="solid",shape="box"];1099 -> 11245[label="",style="solid", color="burlywood", weight=9];
11245 -> 1222[label="",style="solid", color="burlywood", weight=3];
11246[label="zx3100/Neg zx31000",fontsize=10,color="white",style="solid",shape="box"];1099 -> 11246[label="",style="solid", color="burlywood", weight=9];
11246 -> 1223[label="",style="solid", color="burlywood", weight=3];
1100[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11247[label="zx3100/Pos zx31000",fontsize=10,color="white",style="solid",shape="box"];1100 -> 11247[label="",style="solid", color="burlywood", weight=9];
11247 -> 1224[label="",style="solid", color="burlywood", weight=3];
11248[label="zx3100/Neg zx31000",fontsize=10,color="white",style="solid",shape="box"];1100 -> 11248[label="",style="solid", color="burlywood", weight=9];
11248 -> 1225[label="",style="solid", color="burlywood", weight=3];
1101[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx300000)) zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11249[label="zx3100/Pos zx31000",fontsize=10,color="white",style="solid",shape="box"];1101 -> 11249[label="",style="solid", color="burlywood", weight=9];
11249 -> 1226[label="",style="solid", color="burlywood", weight=3];
11250[label="zx3100/Neg zx31000",fontsize=10,color="white",style="solid",shape="box"];1101 -> 11250[label="",style="solid", color="burlywood", weight=9];
11250 -> 1227[label="",style="solid", color="burlywood", weight=3];
1102[label="takeWhile1 (flip (<=) (Integer zx3100)) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) zx3100 == GT))",fontsize=16,color="burlywood",shape="box"];11251[label="zx3100/Pos zx31000",fontsize=10,color="white",style="solid",shape="box"];1102 -> 11251[label="",style="solid", color="burlywood", weight=9];
11251 -> 1228[label="",style="solid", color="burlywood", weight=3];
11252[label="zx3100/Neg zx31000",fontsize=10,color="white",style="solid",shape="box"];1102 -> 11252[label="",style="solid", color="burlywood", weight=9];
11252 -> 1229[label="",style="solid", color="burlywood", weight=3];
1103[label="(++) range40 LT (not (EQ == LT) && LT >= zx300) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1103 -> 1230[label="",style="solid", color="black", weight=3];
1104[label="(++) range40 LT (not (compare1 EQ LT (EQ <= LT) == LT) && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1104 -> 1231[label="",style="solid", color="black", weight=3];
1105[label="(++) range40 LT (not (compare1 GT LT (GT <= LT) == LT) && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1105 -> 1232[label="",style="solid", color="black", weight=3];
1106[label="(++) range00 False (not (EQ == LT) && False >= zx300) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];1106 -> 1233[label="",style="solid", color="black", weight=3];
1107[label="(++) range00 False (not (compare1 True False (True <= False) == LT) && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];1107 -> 1234[label="",style="solid", color="black", weight=3];
1510[label="range (zx40,zx41)",fontsize=16,color="blue",shape="box"];11253[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11253[label="",style="solid", color="blue", weight=9];
11253 -> 1693[label="",style="solid", color="blue", weight=3];
11254[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11254[label="",style="solid", color="blue", weight=9];
11254 -> 1694[label="",style="solid", color="blue", weight=3];
11255[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11255[label="",style="solid", color="blue", weight=9];
11255 -> 1695[label="",style="solid", color="blue", weight=3];
11256[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11256[label="",style="solid", color="blue", weight=9];
11256 -> 1696[label="",style="solid", color="blue", weight=3];
11257[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11257[label="",style="solid", color="blue", weight=9];
11257 -> 1697[label="",style="solid", color="blue", weight=3];
11258[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11258[label="",style="solid", color="blue", weight=9];
11258 -> 1698[label="",style="solid", color="blue", weight=3];
11259[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11259[label="",style="solid", color="blue", weight=9];
11259 -> 1699[label="",style="solid", color="blue", weight=3];
11260[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];1510 -> 11260[label="",style="solid", color="blue", weight=9];
11260 -> 1700[label="",style="solid", color="blue", weight=3];
1511[label="zx39",fontsize=16,color="green",shape="box"];1512[label="zx38",fontsize=16,color="green",shape="box"];1513[label="zx420",fontsize=16,color="green",shape="box"];1138[label="zx1041",fontsize=16,color="green",shape="box"];1139[label="range20 zx101 zx102 zx103 zx1040",fontsize=16,color="black",shape="box"];1139 -> 1308[label="",style="solid", color="black", weight=3];
1661[label="index (zx64,zx67) zx67\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="triangle"];11261[label="zx64/(zx640,zx641,zx642)",fontsize=10,color="white",style="solid",shape="box"];1661 -> 11261[label="",style="solid", color="burlywood", weight=9];
11261 -> 1816[label="",style="solid", color="burlywood", weight=3];
1662[label="index (zx64,zx67) zx67\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="triangle"];11262[label="zx64/(zx640,zx641)",fontsize=10,color="white",style="solid",shape="box"];1662 -> 11262[label="",style="solid", color="burlywood", weight=9];
11262 -> 1817[label="",style="solid", color="burlywood", weight=3];
1663[label="index (zx64,zx67) zx67",fontsize=16,color="black",shape="triangle"];1663 -> 1818[label="",style="solid", color="black", weight=3];
1664[label="index (zx64,zx67) zx67",fontsize=16,color="burlywood",shape="triangle"];11263[label="zx64/()",fontsize=10,color="white",style="solid",shape="box"];1664 -> 11263[label="",style="solid", color="burlywood", weight=9];
11263 -> 1819[label="",style="solid", color="burlywood", weight=3];
1665 -> 1382[label="",style="dashed", color="red", weight=0];
1665[label="index (zx64,zx67) zx67",fontsize=16,color="magenta"];1665 -> 1820[label="",style="dashed", color="magenta", weight=3];
1665 -> 1821[label="",style="dashed", color="magenta", weight=3];
1666[label="index (zx64,zx67) zx67",fontsize=16,color="black",shape="triangle"];1666 -> 1822[label="",style="solid", color="black", weight=3];
1667[label="index (zx64,zx67) zx67",fontsize=16,color="black",shape="triangle"];1667 -> 1823[label="",style="solid", color="black", weight=3];
1668[label="index (zx64,zx67) zx67",fontsize=16,color="black",shape="triangle"];1668 -> 1824[label="",style="solid", color="black", weight=3];
1669[label="zx65\n  Ix a",fontsize=16,color="green",shape="box"];1670[label="zx62\n  Ix a",fontsize=16,color="green",shape="box"];1671[label="zx63\n  Ix a",fontsize=16,color="green",shape="box"];1672[label="zx66\n  Ix a",fontsize=16,color="green",shape="box"];1673[label="primPlusInt (Pos zx1360) (rangeSize (zx137,zx138) * zx139)\n  Ix a",fontsize=16,color="black",shape="box"];1673 -> 1825[label="",style="solid", color="black", weight=3];
1674[label="primPlusInt (Neg zx1360) (rangeSize (zx137,zx138) * zx139)\n  Ix a",fontsize=16,color="black",shape="box"];1674 -> 1826[label="",style="solid", color="black", weight=3];
1675[label="zx490",fontsize=16,color="green",shape="box"];1676[label="range (zx47,zx48)",fontsize=16,color="blue",shape="box"];11265[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11265[label="",style="solid", color="blue", weight=9];
11265 -> 1827[label="",style="solid", color="blue", weight=3];
11266[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11266[label="",style="solid", color="blue", weight=9];
11266 -> 1828[label="",style="solid", color="blue", weight=3];
11267[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11267[label="",style="solid", color="blue", weight=9];
11267 -> 1829[label="",style="solid", color="blue", weight=3];
11268[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11268[label="",style="solid", color="blue", weight=9];
11268 -> 1830[label="",style="solid", color="blue", weight=3];
11269[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11269[label="",style="solid", color="blue", weight=9];
11269 -> 1831[label="",style="solid", color="blue", weight=3];
11270[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11270[label="",style="solid", color="blue", weight=9];
11270 -> 1832[label="",style="solid", color="blue", weight=3];
11271[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11271[label="",style="solid", color="blue", weight=9];
11271 -> 1833[label="",style="solid", color="blue", weight=3];
11272[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];1676 -> 11272[label="",style="solid", color="blue", weight=9];
11272 -> 1834[label="",style="solid", color="blue", weight=3];
1514[label="range50 zx109 zx1100",fontsize=16,color="black",shape="box"];1514 -> 1701[label="",style="solid", color="black", weight=3];
1515[label="zx1101",fontsize=16,color="green",shape="box"];1677 -> 1661[label="",style="dashed", color="red", weight=0];
1677[label="index (zx82,zx84) zx84\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];1677 -> 1835[label="",style="dashed", color="magenta", weight=3];
1677 -> 1836[label="",style="dashed", color="magenta", weight=3];
1678 -> 1662[label="",style="dashed", color="red", weight=0];
1678[label="index (zx82,zx84) zx84\n  Ix a  Ix b",fontsize=16,color="magenta"];1678 -> 1837[label="",style="dashed", color="magenta", weight=3];
1678 -> 1838[label="",style="dashed", color="magenta", weight=3];
1679 -> 1663[label="",style="dashed", color="red", weight=0];
1679[label="index (zx82,zx84) zx84",fontsize=16,color="magenta"];1679 -> 1839[label="",style="dashed", color="magenta", weight=3];
1679 -> 1840[label="",style="dashed", color="magenta", weight=3];
1680 -> 1664[label="",style="dashed", color="red", weight=0];
1680[label="index (zx82,zx84) zx84",fontsize=16,color="magenta"];1680 -> 1841[label="",style="dashed", color="magenta", weight=3];
1680 -> 1842[label="",style="dashed", color="magenta", weight=3];
1681 -> 1382[label="",style="dashed", color="red", weight=0];
1681[label="index (zx82,zx84) zx84",fontsize=16,color="magenta"];1681 -> 1843[label="",style="dashed", color="magenta", weight=3];
1681 -> 1844[label="",style="dashed", color="magenta", weight=3];
1682 -> 1666[label="",style="dashed", color="red", weight=0];
1682[label="index (zx82,zx84) zx84",fontsize=16,color="magenta"];1682 -> 1845[label="",style="dashed", color="magenta", weight=3];
1682 -> 1846[label="",style="dashed", color="magenta", weight=3];
1683 -> 1667[label="",style="dashed", color="red", weight=0];
1683[label="index (zx82,zx84) zx84",fontsize=16,color="magenta"];1683 -> 1847[label="",style="dashed", color="magenta", weight=3];
1683 -> 1848[label="",style="dashed", color="magenta", weight=3];
1684 -> 1668[label="",style="dashed", color="red", weight=0];
1684[label="index (zx82,zx84) zx84",fontsize=16,color="magenta"];1684 -> 1849[label="",style="dashed", color="magenta", weight=3];
1684 -> 1850[label="",style="dashed", color="magenta", weight=3];
1685 -> 1661[label="",style="dashed", color="red", weight=0];
1685[label="index (zx81,zx83) zx83\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];1685 -> 1851[label="",style="dashed", color="magenta", weight=3];
1685 -> 1852[label="",style="dashed", color="magenta", weight=3];
1686 -> 1662[label="",style="dashed", color="red", weight=0];
1686[label="index (zx81,zx83) zx83\n  Ix a  Ix b",fontsize=16,color="magenta"];1686 -> 1853[label="",style="dashed", color="magenta", weight=3];
1686 -> 1854[label="",style="dashed", color="magenta", weight=3];
1687 -> 1663[label="",style="dashed", color="red", weight=0];
1687[label="index (zx81,zx83) zx83",fontsize=16,color="magenta"];1687 -> 1855[label="",style="dashed", color="magenta", weight=3];
1687 -> 1856[label="",style="dashed", color="magenta", weight=3];
1688 -> 1664[label="",style="dashed", color="red", weight=0];
1688[label="index (zx81,zx83) zx83",fontsize=16,color="magenta"];1688 -> 1857[label="",style="dashed", color="magenta", weight=3];
1688 -> 1858[label="",style="dashed", color="magenta", weight=3];
1689 -> 1382[label="",style="dashed", color="red", weight=0];
1689[label="index (zx81,zx83) zx83",fontsize=16,color="magenta"];1689 -> 1859[label="",style="dashed", color="magenta", weight=3];
1689 -> 1860[label="",style="dashed", color="magenta", weight=3];
1690 -> 1666[label="",style="dashed", color="red", weight=0];
1690[label="index (zx81,zx83) zx83",fontsize=16,color="magenta"];1690 -> 1861[label="",style="dashed", color="magenta", weight=3];
1690 -> 1862[label="",style="dashed", color="magenta", weight=3];
1691 -> 1667[label="",style="dashed", color="red", weight=0];
1691[label="index (zx81,zx83) zx83",fontsize=16,color="magenta"];1691 -> 1863[label="",style="dashed", color="magenta", weight=3];
1691 -> 1864[label="",style="dashed", color="magenta", weight=3];
1692 -> 1668[label="",style="dashed", color="red", weight=0];
1692[label="index (zx81,zx83) zx83",fontsize=16,color="magenta"];1692 -> 1865[label="",style="dashed", color="magenta", weight=3];
1692 -> 1866[label="",style="dashed", color="magenta", weight=3];
6594[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx4460) (Succ zx4470) == GT))",fontsize=16,color="black",shape="box"];6594 -> 6640[label="",style="solid", color="black", weight=3];
6595[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx4460) Zero == GT))",fontsize=16,color="black",shape="box"];6595 -> 6641[label="",style="solid", color="black", weight=3];
6596[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx4470) == GT))",fontsize=16,color="black",shape="box"];6596 -> 6642[label="",style="solid", color="black", weight=3];
6597[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];6597 -> 6643[label="",style="solid", color="black", weight=3];
6029[label="rangeSize0 (Integer (Pos (Succ zx380))) (Integer (Pos (Succ zx381))) otherwise",fontsize=16,color="black",shape="box"];6029 -> 6046[label="",style="solid", color="black", weight=3];
6030[label="Pos Zero",fontsize=16,color="green",shape="box"];1145[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) (null (takeWhile0 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx30000))) (numericEnumFrom $! Integer (Pos (Succ zx30000)) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];1145 -> 1326[label="",style="solid", color="black", weight=3];
1146[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Neg zx3100)) True",fontsize=16,color="black",shape="box"];1146 -> 1327[label="",style="solid", color="black", weight=3];
1147[label="rangeSize1 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) False",fontsize=16,color="black",shape="box"];1147 -> 1328[label="",style="solid", color="black", weight=3];
1148[label="rangeSize0 (Integer (Pos Zero)) (Integer (Pos Zero)) otherwise",fontsize=16,color="black",shape="box"];1148 -> 1329[label="",style="solid", color="black", weight=3];
1149[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) (null [])",fontsize=16,color="black",shape="box"];1149 -> 1330[label="",style="solid", color="black", weight=3];
1150[label="rangeSize0 (Integer (Pos Zero)) (Integer (Neg Zero)) otherwise",fontsize=16,color="black",shape="box"];1150 -> 1331[label="",style="solid", color="black", weight=3];
1151[label="rangeSize0 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) True",fontsize=16,color="black",shape="box"];1151 -> 1332[label="",style="solid", color="black", weight=3];
5975 -> 5910[label="",style="dashed", color="red", weight=0];
5975[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx3870 zx3880 == GT))))",fontsize=16,color="magenta"];5975 -> 5998[label="",style="dashed", color="magenta", weight=3];
5975 -> 5999[label="",style="dashed", color="magenta", weight=3];
5976[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (GT == GT))))",fontsize=16,color="black",shape="box"];5976 -> 6000[label="",style="solid", color="black", weight=3];
5977[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (LT == GT))))",fontsize=16,color="black",shape="box"];5977 -> 6001[label="",style="solid", color="black", weight=3];
5978[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not (EQ == GT))))",fontsize=16,color="black",shape="box"];5978 -> 6002[label="",style="solid", color="black", weight=3];
1157[label="rangeSize1 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) False",fontsize=16,color="black",shape="box"];1157 -> 1340[label="",style="solid", color="black", weight=3];
1158[label="rangeSize0 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) otherwise",fontsize=16,color="black",shape="box"];1158 -> 1341[label="",style="solid", color="black", weight=3];
1159[label="rangeSize0 (Integer (Neg Zero)) (Integer (Pos Zero)) otherwise",fontsize=16,color="black",shape="box"];1159 -> 1342[label="",style="solid", color="black", weight=3];
1160[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null (takeWhile0 (flip (<=) (Integer (Neg (Succ zx31000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];1160 -> 1343[label="",style="solid", color="black", weight=3];
1161[label="rangeSize0 (Integer (Neg Zero)) (Integer (Neg Zero)) otherwise",fontsize=16,color="black",shape="box"];1161 -> 1344[label="",style="solid", color="black", weight=3];
6250[label="zx31000",fontsize=16,color="green",shape="box"];6251[label="zx31000",fontsize=16,color="green",shape="box"];6252 -> 6247[label="",style="dashed", color="red", weight=0];
6252[label="Pos (Succ zx30000) + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];6252 -> 6308[label="",style="dashed", color="magenta", weight=3];
6253[label="zx30000",fontsize=16,color="green",shape="box"];6254[label="zx30000",fontsize=16,color="green",shape="box"];1164[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1164 -> 1349[label="",style="solid", color="black", weight=3];
1165[label="takeWhile0 (flip (<=) (Neg zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1165 -> 1350[label="",style="solid", color="black", weight=3];
1166[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1166 -> 1351[label="",style="solid", color="black", weight=3];
1167[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1167 -> 1352[label="",style="solid", color="black", weight=3];
1168[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1168 -> 1353[label="",style="solid", color="black", weight=3];
1169[label="takeWhile1 (flip (<=) (Neg Zero)) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1169 -> 1354[label="",style="solid", color="black", weight=3];
1170[label="Neg (Succ zx30000) : takeWhile (flip (<=) (Pos zx3100)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1170 -> 1355[label="",style="dashed", color="green", weight=3];
6316[label="zx31000",fontsize=16,color="green",shape="box"];6317 -> 2241[label="",style="dashed", color="red", weight=0];
6317[label="Neg (Succ zx30000) + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];6318[label="zx30000",fontsize=16,color="green",shape="box"];6319[label="zx30000",fontsize=16,color="green",shape="box"];6320[label="zx31000",fontsize=16,color="green",shape="box"];1173[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1173 -> 1360[label="",style="solid", color="black", weight=3];
1174[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1174 -> 1361[label="",style="solid", color="black", weight=3];
1175[label="takeWhile1 (flip (<=) (Pos Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1175 -> 1362[label="",style="solid", color="black", weight=3];
1176[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1176 -> 1363[label="",style="solid", color="black", weight=3];
1177[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1177 -> 1364[label="",style="solid", color="black", weight=3];
2345[label="index8 zx30 zx31 zx31 (not (primCmpNat zx13000 zx16100 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="triangle"];11292[label="zx13000/Succ zx130000",fontsize=10,color="white",style="solid",shape="box"];2345 -> 11292[label="",style="solid", color="burlywood", weight=9];
11292 -> 2358[label="",style="solid", color="burlywood", weight=3];
11293[label="zx13000/Zero",fontsize=10,color="white",style="solid",shape="box"];2345 -> 11293[label="",style="solid", color="burlywood", weight=9];
11293 -> 2359[label="",style="solid", color="burlywood", weight=3];
2346 -> 2275[label="",style="dashed", color="red", weight=0];
2346[label="index8 zx30 zx31 zx31 (not (GT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2347[label="index8 zx30 zx31 zx31 (False && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2347 -> 2360[label="",style="solid", color="black", weight=3];
2348[label="zx16200",fontsize=16,color="green",shape="box"];2349[label="Zero",fontsize=16,color="green",shape="box"];2350 -> 2312[label="",style="dashed", color="red", weight=0];
2350[label="index8 zx30 zx31 zx31 (not False && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2351[label="index8 zx30 zx31 zx31 (True && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2351 -> 2361[label="",style="solid", color="black", weight=3];
2352 -> 2345[label="",style="dashed", color="red", weight=0];
2352[label="index8 zx30 zx31 zx31 (not (primCmpNat zx16300 zx13000 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2352 -> 2362[label="",style="dashed", color="magenta", weight=3];
2352 -> 2363[label="",style="dashed", color="magenta", weight=3];
2353 -> 2280[label="",style="dashed", color="red", weight=0];
2353[label="index8 zx30 zx31 zx31 (not (LT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2354[label="zx16400",fontsize=16,color="green",shape="box"];2355[label="Zero",fontsize=16,color="green",shape="box"];6569[label="zx4330",fontsize=16,color="green",shape="box"];6570[label="zx4320",fontsize=16,color="green",shape="box"];6571[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not True)",fontsize=16,color="black",shape="box"];6571 -> 6603[label="",style="solid", color="black", weight=3];
6572[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not False)",fontsize=16,color="black",shape="triangle"];6572 -> 6604[label="",style="solid", color="black", weight=3];
6573 -> 6572[label="",style="dashed", color="red", weight=0];
6573[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) (not False)",fontsize=16,color="magenta"];5120 -> 1381[label="",style="dashed", color="red", weight=0];
5120[label="index (Pos (Succ zx291),Pos (Succ zx292)) (Pos (Succ zx292)) + Pos (Succ Zero)",fontsize=16,color="magenta"];5120 -> 5123[label="",style="dashed", color="magenta", weight=3];
1196[label="rangeSize1 (Pos (Succ zx3000)) (Pos Zero) True",fontsize=16,color="black",shape="box"];1196 -> 1379[label="",style="solid", color="black", weight=3];
1197[label="rangeSize0 (Pos Zero) (Pos (Succ zx3100)) True",fontsize=16,color="black",shape="box"];1197 -> 1380[label="",style="solid", color="black", weight=3];
1198 -> 1381[label="",style="dashed", color="red", weight=0];
1198[label="index (Pos Zero,Pos Zero) (Pos Zero) + Pos (Succ Zero)",fontsize=16,color="magenta"];1198 -> 1387[label="",style="dashed", color="magenta", weight=3];
1199[label="Pos Zero",fontsize=16,color="green",shape="box"];1200 -> 1381[label="",style="dashed", color="red", weight=0];
1200[label="index (Pos Zero,Neg Zero) (Neg Zero) + Pos (Succ Zero)",fontsize=16,color="magenta"];1200 -> 1388[label="",style="dashed", color="magenta", weight=3];
1386[label="index (Neg (Succ zx3000),Pos zx310) (Pos zx310)",fontsize=16,color="black",shape="box"];1386 -> 1405[label="",style="solid", color="black", weight=3];
2563[label="Neg (Succ zx30000)",fontsize=16,color="green",shape="box"];6598[label="zx4380",fontsize=16,color="green",shape="box"];6599[label="zx4390",fontsize=16,color="green",shape="box"];6600[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not True)",fontsize=16,color="black",shape="box"];6600 -> 6644[label="",style="solid", color="black", weight=3];
6601[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not False)",fontsize=16,color="black",shape="triangle"];6601 -> 6645[label="",style="solid", color="black", weight=3];
6602 -> 6601[label="",style="dashed", color="red", weight=0];
6602[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) (not False)",fontsize=16,color="magenta"];5801 -> 1381[label="",style="dashed", color="red", weight=0];
5801[label="index (Neg (Succ zx353),Neg (Succ zx354)) (Neg (Succ zx354)) + Pos (Succ Zero)",fontsize=16,color="magenta"];5801 -> 5845[label="",style="dashed", color="magenta", weight=3];
1209[label="rangeSize0 (Neg (Succ zx3000)) (Neg Zero) True",fontsize=16,color="black",shape="box"];1209 -> 1414[label="",style="solid", color="black", weight=3];
1210 -> 1381[label="",style="dashed", color="red", weight=0];
1210[label="index (Neg Zero,Pos (Succ zx3100)) (Pos (Succ zx3100)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1210 -> 1389[label="",style="dashed", color="magenta", weight=3];
1211 -> 1381[label="",style="dashed", color="red", weight=0];
1211[label="index (Neg Zero,Pos Zero) (Pos Zero) + Pos (Succ Zero)",fontsize=16,color="magenta"];1211 -> 1390[label="",style="dashed", color="magenta", weight=3];
1212[label="rangeSize1 (Neg Zero) (Neg (Succ zx3100)) True",fontsize=16,color="black",shape="box"];1212 -> 1415[label="",style="solid", color="black", weight=3];
1213 -> 1381[label="",style="dashed", color="red", weight=0];
1213[label="index (Neg Zero,Neg Zero) (Neg Zero) + Pos (Succ Zero)",fontsize=16,color="magenta"];1213 -> 1391[label="",style="dashed", color="magenta", weight=3];
1214[label="rangeSize1 LT LT (null ((++) range40 LT (not (compare2 LT LT (LT == LT) == LT)) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1214 -> 1416[label="",style="solid", color="black", weight=3];
1215[label="rangeSize1 EQ LT (null ((++) range40 LT (not (compare2 LT EQ (LT == EQ) == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1215 -> 1417[label="",style="solid", color="black", weight=3];
1216[label="rangeSize1 GT LT (null ((++) range40 LT (not (compare2 LT GT (LT == GT) == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1216 -> 1418[label="",style="solid", color="black", weight=3];
1217[label="rangeSize1 zx30 EQ (null ((++) range40 LT (compare LT zx30 /= LT) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1217 -> 1419[label="",style="solid", color="black", weight=3];
1218[label="rangeSize1 zx30 GT (null ((++) range40 LT (compare LT zx30 /= LT) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1218 -> 1420[label="",style="solid", color="black", weight=3];
1219[label="rangeSize1 False False (null ((++) range00 False (not (compare2 False False (False == False) == LT)) foldr (++) [] (map (range0 False False) (True : []))))",fontsize=16,color="black",shape="box"];1219 -> 1421[label="",style="solid", color="black", weight=3];
1220[label="rangeSize1 True False (null ((++) range00 False (not (compare2 False True (False == True) == LT)) foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];1220 -> 1422[label="",style="solid", color="black", weight=3];
1221[label="rangeSize1 zx30 True (null ((++) range00 False (compare False zx30 /= LT) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];1221 -> 1423[label="",style="solid", color="black", weight=3];
1222[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx300000)) (Pos zx31000) == GT))",fontsize=16,color="black",shape="box"];1222 -> 1424[label="",style="solid", color="black", weight=3];
1223[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ zx300000)) (Neg zx31000) == GT))",fontsize=16,color="black",shape="box"];1223 -> 1425[label="",style="solid", color="black", weight=3];
1224[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos zx31000) == GT))",fontsize=16,color="burlywood",shape="box"];11307[label="zx31000/Succ zx310000",fontsize=10,color="white",style="solid",shape="box"];1224 -> 11307[label="",style="solid", color="burlywood", weight=9];
11307 -> 1426[label="",style="solid", color="burlywood", weight=3];
11308[label="zx31000/Zero",fontsize=10,color="white",style="solid",shape="box"];1224 -> 11308[label="",style="solid", color="burlywood", weight=9];
11308 -> 1427[label="",style="solid", color="burlywood", weight=3];
1225[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg zx31000) == GT))",fontsize=16,color="burlywood",shape="box"];11309[label="zx31000/Succ zx310000",fontsize=10,color="white",style="solid",shape="box"];1225 -> 11309[label="",style="solid", color="burlywood", weight=9];
11309 -> 1428[label="",style="solid", color="burlywood", weight=3];
11310[label="zx31000/Zero",fontsize=10,color="white",style="solid",shape="box"];1225 -> 11310[label="",style="solid", color="burlywood", weight=9];
11310 -> 1429[label="",style="solid", color="burlywood", weight=3];
1226[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx300000)) (Pos zx31000) == GT))",fontsize=16,color="black",shape="box"];1226 -> 1430[label="",style="solid", color="black", weight=3];
1227[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg (Succ zx300000)) (Neg zx31000) == GT))",fontsize=16,color="black",shape="box"];1227 -> 1431[label="",style="solid", color="black", weight=3];
1228[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos zx31000) == GT))",fontsize=16,color="burlywood",shape="box"];11311[label="zx31000/Succ zx310000",fontsize=10,color="white",style="solid",shape="box"];1228 -> 11311[label="",style="solid", color="burlywood", weight=9];
11311 -> 1432[label="",style="solid", color="burlywood", weight=3];
11312[label="zx31000/Zero",fontsize=10,color="white",style="solid",shape="box"];1228 -> 11312[label="",style="solid", color="burlywood", weight=9];
11312 -> 1433[label="",style="solid", color="burlywood", weight=3];
1229[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg zx31000) == GT))",fontsize=16,color="burlywood",shape="box"];11313[label="zx31000/Succ zx310000",fontsize=10,color="white",style="solid",shape="box"];1229 -> 11313[label="",style="solid", color="burlywood", weight=9];
11313 -> 1434[label="",style="solid", color="burlywood", weight=3];
11314[label="zx31000/Zero",fontsize=10,color="white",style="solid",shape="box"];1229 -> 11314[label="",style="solid", color="burlywood", weight=9];
11314 -> 1435[label="",style="solid", color="burlywood", weight=3];
1230[label="(++) range40 LT (not False && LT >= zx300) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1230 -> 1436[label="",style="solid", color="black", weight=3];
1231[label="(++) range40 LT (not (compare1 EQ LT False == LT) && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1231 -> 1437[label="",style="solid", color="black", weight=3];
1232[label="(++) range40 LT (not (compare1 GT LT False == LT) && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1232 -> 1438[label="",style="solid", color="black", weight=3];
1233[label="(++) range00 False (not False && False >= zx300) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];1233 -> 1439[label="",style="solid", color="black", weight=3];
1234[label="(++) range00 False (not (compare1 True False False == LT) && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];1234 -> 1440[label="",style="solid", color="black", weight=3];
1693[label="range (zx40,zx41)",fontsize=16,color="burlywood",shape="triangle"];11315[label="zx40/(zx400,zx401,zx402)",fontsize=10,color="white",style="solid",shape="box"];1693 -> 11315[label="",style="solid", color="burlywood", weight=9];
11315 -> 1867[label="",style="solid", color="burlywood", weight=3];
1694[label="range (zx40,zx41)",fontsize=16,color="burlywood",shape="triangle"];11316[label="zx40/(zx400,zx401)",fontsize=10,color="white",style="solid",shape="box"];1694 -> 11316[label="",style="solid", color="burlywood", weight=9];
11316 -> 1868[label="",style="solid", color="burlywood", weight=3];
1695 -> 106[label="",style="dashed", color="red", weight=0];
1695[label="range (zx40,zx41)",fontsize=16,color="magenta"];1695 -> 1869[label="",style="dashed", color="magenta", weight=3];
1695 -> 1870[label="",style="dashed", color="magenta", weight=3];
1696 -> 107[label="",style="dashed", color="red", weight=0];
1696[label="range (zx40,zx41)",fontsize=16,color="magenta"];1696 -> 1871[label="",style="dashed", color="magenta", weight=3];
1696 -> 1872[label="",style="dashed", color="magenta", weight=3];
1697 -> 108[label="",style="dashed", color="red", weight=0];
1697[label="range (zx40,zx41)",fontsize=16,color="magenta"];1697 -> 1873[label="",style="dashed", color="magenta", weight=3];
1697 -> 1874[label="",style="dashed", color="magenta", weight=3];
1698 -> 109[label="",style="dashed", color="red", weight=0];
1698[label="range (zx40,zx41)",fontsize=16,color="magenta"];1698 -> 1875[label="",style="dashed", color="magenta", weight=3];
1698 -> 1876[label="",style="dashed", color="magenta", weight=3];
1699 -> 110[label="",style="dashed", color="red", weight=0];
1699[label="range (zx40,zx41)",fontsize=16,color="magenta"];1699 -> 1877[label="",style="dashed", color="magenta", weight=3];
1699 -> 1878[label="",style="dashed", color="magenta", weight=3];
1700 -> 111[label="",style="dashed", color="red", weight=0];
1700[label="range (zx40,zx41)",fontsize=16,color="magenta"];1700 -> 1879[label="",style="dashed", color="magenta", weight=3];
1700 -> 1880[label="",style="dashed", color="magenta", weight=3];
1308[label="concatMap (range1 zx101 zx1040) (range (zx102,zx103))",fontsize=16,color="black",shape="box"];1308 -> 1441[label="",style="solid", color="black", weight=3];
1816[label="index ((zx640,zx641,zx642),zx67) zx67\n  Ix a  Ix b  Ix c",fontsize=16,color="burlywood",shape="box"];11323[label="zx67/(zx670,zx671,zx672)",fontsize=10,color="white",style="solid",shape="box"];1816 -> 11323[label="",style="solid", color="burlywood", weight=9];
11323 -> 1937[label="",style="solid", color="burlywood", weight=3];
1817[label="index ((zx640,zx641),zx67) zx67\n  Ix a  Ix b",fontsize=16,color="burlywood",shape="box"];11324[label="zx67/(zx670,zx671)",fontsize=10,color="white",style="solid",shape="box"];1817 -> 11324[label="",style="solid", color="burlywood", weight=9];
11324 -> 1938[label="",style="solid", color="burlywood", weight=3];
1818[label="index6 (zx64,zx67) zx67",fontsize=16,color="black",shape="triangle"];1818 -> 1939[label="",style="solid", color="black", weight=3];
1819[label="index ((),zx67) zx67",fontsize=16,color="burlywood",shape="box"];11325[label="zx67/()",fontsize=10,color="white",style="solid",shape="box"];1819 -> 11325[label="",style="solid", color="burlywood", weight=9];
11325 -> 1940[label="",style="solid", color="burlywood", weight=3];
1820[label="zx64",fontsize=16,color="green",shape="box"];1821[label="zx67",fontsize=16,color="green",shape="box"];1822[label="index13 (zx64,zx67) zx67",fontsize=16,color="black",shape="box"];1822 -> 1941[label="",style="solid", color="black", weight=3];
1823[label="index3 zx67 zx64 (zx67 >= zx67 && zx67 >= zx64)",fontsize=16,color="black",shape="box"];1823 -> 1942[label="",style="solid", color="black", weight=3];
1824[label="index2 zx67 zx64 (zx67 >= zx67 && zx67 >= zx64)",fontsize=16,color="black",shape="box"];1824 -> 1943[label="",style="solid", color="black", weight=3];
1825 -> 1944[label="",style="dashed", color="red", weight=0];
1825[label="primPlusInt (Pos zx1360) (primMulInt (rangeSize (zx137,zx138)) zx139)\n  Ix a",fontsize=16,color="magenta"];1825 -> 1945[label="",style="dashed", color="magenta", weight=3];
1825 -> 1946[label="",style="dashed", color="magenta", weight=3];
1825 -> 1947[label="",style="dashed", color="magenta", weight=3];
1826 -> 1954[label="",style="dashed", color="red", weight=0];
1826[label="primPlusInt (Neg zx1360) (primMulInt (rangeSize (zx137,zx138)) zx139)\n  Ix a",fontsize=16,color="magenta"];1826 -> 1955[label="",style="dashed", color="magenta", weight=3];
1826 -> 1956[label="",style="dashed", color="magenta", weight=3];
1826 -> 1957[label="",style="dashed", color="magenta", weight=3];
1827 -> 1693[label="",style="dashed", color="red", weight=0];
1827[label="range (zx47,zx48)",fontsize=16,color="magenta"];1827 -> 1964[label="",style="dashed", color="magenta", weight=3];
1827 -> 1965[label="",style="dashed", color="magenta", weight=3];
1828 -> 1694[label="",style="dashed", color="red", weight=0];
1828[label="range (zx47,zx48)",fontsize=16,color="magenta"];1828 -> 1966[label="",style="dashed", color="magenta", weight=3];
1828 -> 1967[label="",style="dashed", color="magenta", weight=3];
1829 -> 106[label="",style="dashed", color="red", weight=0];
1829[label="range (zx47,zx48)",fontsize=16,color="magenta"];1829 -> 1968[label="",style="dashed", color="magenta", weight=3];
1829 -> 1969[label="",style="dashed", color="magenta", weight=3];
1830 -> 107[label="",style="dashed", color="red", weight=0];
1830[label="range (zx47,zx48)",fontsize=16,color="magenta"];1830 -> 1970[label="",style="dashed", color="magenta", weight=3];
1830 -> 1971[label="",style="dashed", color="magenta", weight=3];
1831 -> 108[label="",style="dashed", color="red", weight=0];
1831[label="range (zx47,zx48)",fontsize=16,color="magenta"];1831 -> 1972[label="",style="dashed", color="magenta", weight=3];
1831 -> 1973[label="",style="dashed", color="magenta", weight=3];
1832 -> 109[label="",style="dashed", color="red", weight=0];
1832[label="range (zx47,zx48)",fontsize=16,color="magenta"];1832 -> 1974[label="",style="dashed", color="magenta", weight=3];
1832 -> 1975[label="",style="dashed", color="magenta", weight=3];
1833 -> 110[label="",style="dashed", color="red", weight=0];
1833[label="range (zx47,zx48)",fontsize=16,color="magenta"];1833 -> 1976[label="",style="dashed", color="magenta", weight=3];
1833 -> 1977[label="",style="dashed", color="magenta", weight=3];
1834 -> 111[label="",style="dashed", color="red", weight=0];
1834[label="range (zx47,zx48)",fontsize=16,color="magenta"];1834 -> 1978[label="",style="dashed", color="magenta", weight=3];
1834 -> 1979[label="",style="dashed", color="magenta", weight=3];
1701[label="(zx109,zx1100) : []",fontsize=16,color="green",shape="box"];1835[label="zx82\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1836[label="zx84\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1837[label="zx82\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1838[label="zx84\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1839[label="zx82",fontsize=16,color="green",shape="box"];1840[label="zx84",fontsize=16,color="green",shape="box"];1841[label="zx82",fontsize=16,color="green",shape="box"];1842[label="zx84",fontsize=16,color="green",shape="box"];1843[label="zx82",fontsize=16,color="green",shape="box"];1844[label="zx84",fontsize=16,color="green",shape="box"];1845[label="zx82",fontsize=16,color="green",shape="box"];1846[label="zx84",fontsize=16,color="green",shape="box"];1847[label="zx82",fontsize=16,color="green",shape="box"];1848[label="zx84",fontsize=16,color="green",shape="box"];1849[label="zx82",fontsize=16,color="green",shape="box"];1850[label="zx84",fontsize=16,color="green",shape="box"];1851[label="zx81\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1852[label="zx83\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];1853[label="zx81\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1854[label="zx83\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];1855[label="zx81",fontsize=16,color="green",shape="box"];1856[label="zx83",fontsize=16,color="green",shape="box"];1857[label="zx81",fontsize=16,color="green",shape="box"];1858[label="zx83",fontsize=16,color="green",shape="box"];1859[label="zx81",fontsize=16,color="green",shape="box"];1860[label="zx83",fontsize=16,color="green",shape="box"];1861[label="zx81",fontsize=16,color="green",shape="box"];1862[label="zx83",fontsize=16,color="green",shape="box"];1863[label="zx81",fontsize=16,color="green",shape="box"];1864[label="zx83",fontsize=16,color="green",shape="box"];1865[label="zx81",fontsize=16,color="green",shape="box"];1866[label="zx83",fontsize=16,color="green",shape="box"];6640 -> 6518[label="",style="dashed", color="red", weight=0];
6640[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx4460 zx4470 == GT))",fontsize=16,color="magenta"];6640 -> 6733[label="",style="dashed", color="magenta", weight=3];
6640 -> 6734[label="",style="dashed", color="magenta", weight=3];
6641[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];6641 -> 6735[label="",style="solid", color="black", weight=3];
6642[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];6642 -> 6736[label="",style="solid", color="black", weight=3];
6643[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];6643 -> 6737[label="",style="solid", color="black", weight=3];
6046[label="rangeSize0 (Integer (Pos (Succ zx380))) (Integer (Pos (Succ zx381))) True",fontsize=16,color="black",shape="box"];6046 -> 6060[label="",style="solid", color="black", weight=3];
1326[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) (null [])",fontsize=16,color="black",shape="box"];1326 -> 1449[label="",style="solid", color="black", weight=3];
1327[label="Pos Zero",fontsize=16,color="green",shape="box"];1328[label="rangeSize0 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) otherwise",fontsize=16,color="black",shape="box"];1328 -> 1450[label="",style="solid", color="black", weight=3];
1329[label="rangeSize0 (Integer (Pos Zero)) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];1329 -> 1451[label="",style="solid", color="black", weight=3];
1330[label="rangeSize1 (Integer (Pos Zero)) (Integer (Neg (Succ zx31000))) True",fontsize=16,color="black",shape="box"];1330 -> 1452[label="",style="solid", color="black", weight=3];
1331[label="rangeSize0 (Integer (Pos Zero)) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];1331 -> 1453[label="",style="solid", color="black", weight=3];
1332 -> 1381[label="",style="dashed", color="red", weight=0];
1332[label="index (Integer (Neg (Succ zx30000)),Integer (Pos zx3100)) (Integer (Pos zx3100)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1332 -> 1392[label="",style="dashed", color="magenta", weight=3];
5998[label="zx3870",fontsize=16,color="green",shape="box"];5999[label="zx3880",fontsize=16,color="green",shape="box"];6000[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not True)))",fontsize=16,color="black",shape="box"];6000 -> 6008[label="",style="solid", color="black", weight=3];
6001[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="black",shape="triangle"];6001 -> 6009[label="",style="solid", color="black", weight=3];
6002 -> 6001[label="",style="dashed", color="red", weight=0];
6002[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) (not False)))",fontsize=16,color="magenta"];1340[label="rangeSize0 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) otherwise",fontsize=16,color="black",shape="box"];1340 -> 1461[label="",style="solid", color="black", weight=3];
1341[label="rangeSize0 (Integer (Neg Zero)) (Integer (Pos (Succ zx31000))) True",fontsize=16,color="black",shape="box"];1341 -> 1462[label="",style="solid", color="black", weight=3];
1342[label="rangeSize0 (Integer (Neg Zero)) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];1342 -> 1463[label="",style="solid", color="black", weight=3];
1343[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) (null [])",fontsize=16,color="black",shape="box"];1343 -> 1464[label="",style="solid", color="black", weight=3];
1344[label="rangeSize0 (Integer (Neg Zero)) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];1344 -> 1465[label="",style="solid", color="black", weight=3];
6308[label="zx30000",fontsize=16,color="green",shape="box"];1349[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1349 -> 1470[label="",style="solid", color="black", weight=3];
1350[label="takeWhile0 (flip (<=) (Neg zx3100)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1350 -> 1471[label="",style="solid", color="black", weight=3];
1351[label="takeWhile1 (flip (<=) (Pos (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1351 -> 1472[label="",style="solid", color="black", weight=3];
1352[label="Pos Zero : takeWhile (flip (<=) (Pos Zero)) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1352 -> 1473[label="",style="dashed", color="green", weight=3];
1353[label="takeWhile0 (flip (<=) (Neg (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1353 -> 1474[label="",style="solid", color="black", weight=3];
1354[label="Pos Zero : takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1354 -> 1475[label="",style="dashed", color="green", weight=3];
1355[label="takeWhile (flip (<=) (Pos zx3100)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1355 -> 1476[label="",style="solid", color="black", weight=3];
1360[label="takeWhile1 (flip (<=) (Neg Zero)) (Neg (Succ zx30000)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1360 -> 1481[label="",style="solid", color="black", weight=3];
1361[label="Neg Zero : takeWhile (flip (<=) (Pos (Succ zx31000))) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1361 -> 1482[label="",style="dashed", color="green", weight=3];
1362[label="Neg Zero : takeWhile (flip (<=) (Pos Zero)) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1362 -> 1483[label="",style="dashed", color="green", weight=3];
1363[label="takeWhile1 (flip (<=) (Neg (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1363 -> 1484[label="",style="solid", color="black", weight=3];
1364[label="Neg Zero : takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1364 -> 1485[label="",style="dashed", color="green", weight=3];
2358[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx130000) zx16100 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11339[label="zx16100/Succ zx161000",fontsize=10,color="white",style="solid",shape="box"];2358 -> 11339[label="",style="solid", color="burlywood", weight=9];
11339 -> 2366[label="",style="solid", color="burlywood", weight=3];
11340[label="zx16100/Zero",fontsize=10,color="white",style="solid",shape="box"];2358 -> 11340[label="",style="solid", color="burlywood", weight=9];
11340 -> 2367[label="",style="solid", color="burlywood", weight=3];
2359[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero zx16100 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="burlywood",shape="box"];11341[label="zx16100/Succ zx161000",fontsize=10,color="white",style="solid",shape="box"];2359 -> 11341[label="",style="solid", color="burlywood", weight=9];
11341 -> 2368[label="",style="solid", color="burlywood", weight=3];
11342[label="zx16100/Zero",fontsize=10,color="white",style="solid",shape="box"];2359 -> 11342[label="",style="solid", color="burlywood", weight=9];
11342 -> 2369[label="",style="solid", color="burlywood", weight=3];
2360[label="index8 zx30 zx31 zx31 False",fontsize=16,color="black",shape="triangle"];2360 -> 2370[label="",style="solid", color="black", weight=3];
2361[label="index8 zx30 zx31 zx31 (inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2361 -> 2371[label="",style="solid", color="black", weight=3];
2362[label="zx13000",fontsize=16,color="green",shape="box"];2363[label="zx16300",fontsize=16,color="green",shape="box"];6603[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) False",fontsize=16,color="black",shape="box"];6603 -> 6646[label="",style="solid", color="black", weight=3];
6604[label="takeWhile1 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) True",fontsize=16,color="black",shape="box"];6604 -> 6647[label="",style="solid", color="black", weight=3];
5123 -> 1666[label="",style="dashed", color="red", weight=0];
5123[label="index (Pos (Succ zx291),Pos (Succ zx292)) (Pos (Succ zx292))",fontsize=16,color="magenta"];5123 -> 5129[label="",style="dashed", color="magenta", weight=3];
5123 -> 5130[label="",style="dashed", color="magenta", weight=3];
1379[label="Pos Zero",fontsize=16,color="green",shape="box"];1380 -> 1381[label="",style="dashed", color="red", weight=0];
1380[label="index (Pos Zero,Pos (Succ zx3100)) (Pos (Succ zx3100)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1380 -> 1393[label="",style="dashed", color="magenta", weight=3];
1387[label="index (Pos Zero,Pos Zero) (Pos Zero)",fontsize=16,color="black",shape="box"];1387 -> 1496[label="",style="solid", color="black", weight=3];
1388[label="index (Pos Zero,Neg Zero) (Neg Zero)",fontsize=16,color="black",shape="box"];1388 -> 1497[label="",style="solid", color="black", weight=3];
1405[label="index13 (Neg (Succ zx3000),Pos zx310) (Pos zx310)",fontsize=16,color="black",shape="box"];1405 -> 1516[label="",style="solid", color="black", weight=3];
6644[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) False",fontsize=16,color="black",shape="box"];6644 -> 6738[label="",style="solid", color="black", weight=3];
6645[label="takeWhile1 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) True",fontsize=16,color="black",shape="box"];6645 -> 6739[label="",style="solid", color="black", weight=3];
5845 -> 1666[label="",style="dashed", color="red", weight=0];
5845[label="index (Neg (Succ zx353),Neg (Succ zx354)) (Neg (Succ zx354))",fontsize=16,color="magenta"];5845 -> 5858[label="",style="dashed", color="magenta", weight=3];
5845 -> 5859[label="",style="dashed", color="magenta", weight=3];
1414 -> 1381[label="",style="dashed", color="red", weight=0];
1414[label="index (Neg (Succ zx3000),Neg Zero) (Neg Zero) + Pos (Succ Zero)",fontsize=16,color="magenta"];1414 -> 1527[label="",style="dashed", color="magenta", weight=3];
1389[label="index (Neg Zero,Pos (Succ zx3100)) (Pos (Succ zx3100))",fontsize=16,color="black",shape="box"];1389 -> 1498[label="",style="solid", color="black", weight=3];
1390[label="index (Neg Zero,Pos Zero) (Pos Zero)",fontsize=16,color="black",shape="box"];1390 -> 1499[label="",style="solid", color="black", weight=3];
1415[label="Pos Zero",fontsize=16,color="green",shape="box"];1391[label="index (Neg Zero,Neg Zero) (Neg Zero)",fontsize=16,color="black",shape="box"];1391 -> 1500[label="",style="solid", color="black", weight=3];
1416[label="rangeSize1 LT LT (null ((++) range40 LT (not (compare2 LT LT True == LT)) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1416 -> 1528[label="",style="solid", color="black", weight=3];
1417[label="rangeSize1 EQ LT (null ((++) range40 LT (not (compare2 LT EQ False == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1417 -> 1529[label="",style="solid", color="black", weight=3];
1418[label="rangeSize1 GT LT (null ((++) range40 LT (not (compare2 LT GT False == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1418 -> 1530[label="",style="solid", color="black", weight=3];
1419[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare LT zx30 == LT)) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1419 -> 1531[label="",style="solid", color="black", weight=3];
1420[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare LT zx30 == LT)) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1420 -> 1532[label="",style="solid", color="black", weight=3];
1421[label="rangeSize1 False False (null ((++) range00 False (not (compare2 False False True == LT)) foldr (++) [] (map (range0 False False) (True : []))))",fontsize=16,color="black",shape="box"];1421 -> 1533[label="",style="solid", color="black", weight=3];
1422[label="rangeSize1 True False (null ((++) range00 False (not (compare2 False True False == LT)) foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];1422 -> 1534[label="",style="solid", color="black", weight=3];
1423[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare False zx30 == LT)) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];1423 -> 1535[label="",style="solid", color="black", weight=3];
1424[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx300000) zx31000 == GT))",fontsize=16,color="burlywood",shape="box"];11347[label="zx31000/Succ zx310000",fontsize=10,color="white",style="solid",shape="box"];1424 -> 11347[label="",style="solid", color="burlywood", weight=9];
11347 -> 1536[label="",style="solid", color="burlywood", weight=3];
11348[label="zx31000/Zero",fontsize=10,color="white",style="solid",shape="box"];1424 -> 11348[label="",style="solid", color="burlywood", weight=9];
11348 -> 1537[label="",style="solid", color="burlywood", weight=3];
1425[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1425 -> 1538[label="",style="solid", color="black", weight=3];
1426[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ zx310000)) == GT))",fontsize=16,color="black",shape="box"];1426 -> 1539[label="",style="solid", color="black", weight=3];
1427[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1427 -> 1540[label="",style="solid", color="black", weight=3];
1428[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg (Succ zx310000)) == GT))",fontsize=16,color="black",shape="box"];1428 -> 1541[label="",style="solid", color="black", weight=3];
1429[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Pos Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];1429 -> 1542[label="",style="solid", color="black", weight=3];
1430[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1430 -> 1543[label="",style="solid", color="black", weight=3];
1431[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx31000 (Succ zx300000) == GT))",fontsize=16,color="burlywood",shape="box"];11349[label="zx31000/Succ zx310000",fontsize=10,color="white",style="solid",shape="box"];1431 -> 11349[label="",style="solid", color="burlywood", weight=9];
11349 -> 1544[label="",style="solid", color="burlywood", weight=3];
11350[label="zx31000/Zero",fontsize=10,color="white",style="solid",shape="box"];1431 -> 11350[label="",style="solid", color="burlywood", weight=9];
11350 -> 1545[label="",style="solid", color="burlywood", weight=3];
1432[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos (Succ zx310000)) == GT))",fontsize=16,color="black",shape="box"];1432 -> 1546[label="",style="solid", color="black", weight=3];
1433[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1433 -> 1547[label="",style="solid", color="black", weight=3];
1434[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg (Succ zx310000)) == GT))",fontsize=16,color="black",shape="box"];1434 -> 1548[label="",style="solid", color="black", weight=3];
1435[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];1435 -> 1549[label="",style="solid", color="black", weight=3];
1436[label="(++) range40 LT (True && LT >= zx300) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1436 -> 1550[label="",style="solid", color="black", weight=3];
1437[label="(++) range40 LT (not (compare0 EQ LT otherwise == LT) && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1437 -> 1551[label="",style="solid", color="black", weight=3];
1438[label="(++) range40 LT (not (compare0 GT LT otherwise == LT) && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1438 -> 1552[label="",style="solid", color="black", weight=3];
1439[label="(++) range00 False (True && False >= zx300) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];1439 -> 1553[label="",style="solid", color="black", weight=3];
1440[label="(++) range00 False (not (compare0 True False otherwise == LT) && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];1440 -> 1554[label="",style="solid", color="black", weight=3];
1867[label="range ((zx400,zx401,zx402),zx41)",fontsize=16,color="burlywood",shape="box"];11351[label="zx41/(zx410,zx411,zx412)",fontsize=10,color="white",style="solid",shape="box"];1867 -> 11351[label="",style="solid", color="burlywood", weight=9];
11351 -> 1980[label="",style="solid", color="burlywood", weight=3];
1868[label="range ((zx400,zx401),zx41)",fontsize=16,color="burlywood",shape="box"];11352[label="zx41/(zx410,zx411)",fontsize=10,color="white",style="solid",shape="box"];1868 -> 11352[label="",style="solid", color="burlywood", weight=9];
11352 -> 1981[label="",style="solid", color="burlywood", weight=3];
1869[label="zx40",fontsize=16,color="green",shape="box"];1870[label="zx41",fontsize=16,color="green",shape="box"];1871[label="zx40",fontsize=16,color="green",shape="box"];1872[label="zx41",fontsize=16,color="green",shape="box"];1873[label="zx40",fontsize=16,color="green",shape="box"];1874[label="zx41",fontsize=16,color="green",shape="box"];1875[label="zx40",fontsize=16,color="green",shape="box"];1876[label="zx41",fontsize=16,color="green",shape="box"];1877[label="zx40",fontsize=16,color="green",shape="box"];1878[label="zx41",fontsize=16,color="green",shape="box"];1879[label="zx40",fontsize=16,color="green",shape="box"];1880[label="zx41",fontsize=16,color="green",shape="box"];1441[label="concat . map (range1 zx101 zx1040)",fontsize=16,color="black",shape="box"];1441 -> 1555[label="",style="solid", color="black", weight=3];
1937[label="index ((zx640,zx641,zx642),(zx670,zx671,zx672)) (zx670,zx671,zx672)\n  Ix a  Ix b  Ix c",fontsize=16,color="black",shape="box"];1937 -> 1982[label="",style="solid", color="black", weight=3];
1938[label="index ((zx640,zx641),(zx670,zx671)) (zx670,zx671)\n  Ix a  Ix b",fontsize=16,color="black",shape="box"];1938 -> 1983[label="",style="solid", color="black", weight=3];
1939[label="index5 zx64 zx67 zx67 (inRange (zx64,zx67) zx67)",fontsize=16,color="black",shape="box"];1939 -> 1984[label="",style="solid", color="black", weight=3];
1940[label="index ((),()) ()",fontsize=16,color="black",shape="box"];1940 -> 1985[label="",style="solid", color="black", weight=3];
1941[label="index12 zx64 zx67 zx67 (inRange (zx64,zx67) zx67)",fontsize=16,color="black",shape="triangle"];1941 -> 1986[label="",style="solid", color="black", weight=3];
1942[label="index3 zx67 zx64 (compare zx67 zx67 /= LT && zx67 >= zx64)",fontsize=16,color="black",shape="box"];1942 -> 1987[label="",style="solid", color="black", weight=3];
1943[label="index2 zx67 zx64 (compare zx67 zx67 /= LT && zx67 >= zx64)",fontsize=16,color="black",shape="box"];1943 -> 1988[label="",style="solid", color="black", weight=3];
1945[label="zx139",fontsize=16,color="green",shape="box"];1946[label="rangeSize (zx137,zx138)\n  Ix a",fontsize=16,color="blue",shape="box"];11353[label="rangeSize :: ((@2) ((@3) a b c) ((@3) a b c)) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11353[label="",style="solid", color="blue", weight=9];
11353 -> 1989[label="",style="solid", color="blue", weight=3];
11354[label="rangeSize :: ((@2) ((@2) a b) ((@2) a b)) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11354[label="",style="solid", color="blue", weight=9];
11354 -> 1990[label="",style="solid", color="blue", weight=3];
11355[label="rangeSize :: ((@2) Integer Integer) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11355[label="",style="solid", color="blue", weight=9];
11355 -> 1991[label="",style="solid", color="blue", weight=3];
11356[label="rangeSize :: ((@2) () ()) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11356[label="",style="solid", color="blue", weight=9];
11356 -> 1992[label="",style="solid", color="blue", weight=3];
11357[label="rangeSize :: ((@2) Char Char) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11357[label="",style="solid", color="blue", weight=9];
11357 -> 1993[label="",style="solid", color="blue", weight=3];
11358[label="rangeSize :: ((@2) Int Int) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11358[label="",style="solid", color="blue", weight=9];
11358 -> 1994[label="",style="solid", color="blue", weight=3];
11359[label="rangeSize :: ((@2) Ordering Ordering) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11359[label="",style="solid", color="blue", weight=9];
11359 -> 1995[label="",style="solid", color="blue", weight=3];
11360[label="rangeSize :: ((@2) Bool Bool) -> Int",fontsize=10,color="white",style="solid",shape="box"];1946 -> 11360[label="",style="solid", color="blue", weight=9];
11360 -> 1996[label="",style="solid", color="blue", weight=3];
1947[label="zx1360",fontsize=16,color="green",shape="box"];1944[label="primPlusInt (Pos zx151) (primMulInt zx152 zx153)",fontsize=16,color="burlywood",shape="triangle"];11361[label="zx152/Pos zx1520",fontsize=10,color="white",style="solid",shape="box"];1944 -> 11361[label="",style="solid", color="burlywood", weight=9];
11361 -> 1997[label="",style="solid", color="burlywood", weight=3];
11362[label="zx152/Neg zx1520",fontsize=10,color="white",style="solid",shape="box"];1944 -> 11362[label="",style="solid", color="burlywood", weight=9];
11362 -> 1998[label="",style="solid", color="burlywood", weight=3];
1955[label="rangeSize (zx137,zx138)\n  Ix a",fontsize=16,color="blue",shape="box"];11363[label="rangeSize :: ((@2) ((@3) a b c) ((@3) a b c)) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11363[label="",style="solid", color="blue", weight=9];
11363 -> 1999[label="",style="solid", color="blue", weight=3];
11364[label="rangeSize :: ((@2) ((@2) a b) ((@2) a b)) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11364[label="",style="solid", color="blue", weight=9];
11364 -> 2000[label="",style="solid", color="blue", weight=3];
11365[label="rangeSize :: ((@2) Integer Integer) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11365[label="",style="solid", color="blue", weight=9];
11365 -> 2001[label="",style="solid", color="blue", weight=3];
11366[label="rangeSize :: ((@2) () ()) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11366[label="",style="solid", color="blue", weight=9];
11366 -> 2002[label="",style="solid", color="blue", weight=3];
11367[label="rangeSize :: ((@2) Char Char) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11367[label="",style="solid", color="blue", weight=9];
11367 -> 2003[label="",style="solid", color="blue", weight=3];
11368[label="rangeSize :: ((@2) Int Int) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11368[label="",style="solid", color="blue", weight=9];
11368 -> 2004[label="",style="solid", color="blue", weight=3];
11369[label="rangeSize :: ((@2) Ordering Ordering) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11369[label="",style="solid", color="blue", weight=9];
11369 -> 2005[label="",style="solid", color="blue", weight=3];
11370[label="rangeSize :: ((@2) Bool Bool) -> Int",fontsize=10,color="white",style="solid",shape="box"];1955 -> 11370[label="",style="solid", color="blue", weight=9];
11370 -> 2006[label="",style="solid", color="blue", weight=3];
1956[label="zx139",fontsize=16,color="green",shape="box"];1957[label="zx1360",fontsize=16,color="green",shape="box"];1954[label="primPlusInt (Neg zx158) (primMulInt zx159 zx160)",fontsize=16,color="burlywood",shape="triangle"];11371[label="zx159/Pos zx1590",fontsize=10,color="white",style="solid",shape="box"];1954 -> 11371[label="",style="solid", color="burlywood", weight=9];
11371 -> 2007[label="",style="solid", color="burlywood", weight=3];
11372[label="zx159/Neg zx1590",fontsize=10,color="white",style="solid",shape="box"];1954 -> 11372[label="",style="solid", color="burlywood", weight=9];
11372 -> 2008[label="",style="solid", color="burlywood", weight=3];
1964[label="zx48",fontsize=16,color="green",shape="box"];1965[label="zx47",fontsize=16,color="green",shape="box"];1966[label="zx48",fontsize=16,color="green",shape="box"];1967[label="zx47",fontsize=16,color="green",shape="box"];1968[label="zx47",fontsize=16,color="green",shape="box"];1969[label="zx48",fontsize=16,color="green",shape="box"];1970[label="zx47",fontsize=16,color="green",shape="box"];1971[label="zx48",fontsize=16,color="green",shape="box"];1972[label="zx47",fontsize=16,color="green",shape="box"];1973[label="zx48",fontsize=16,color="green",shape="box"];1974[label="zx47",fontsize=16,color="green",shape="box"];1975[label="zx48",fontsize=16,color="green",shape="box"];1976[label="zx47",fontsize=16,color="green",shape="box"];1977[label="zx48",fontsize=16,color="green",shape="box"];1978[label="zx47",fontsize=16,color="green",shape="box"];1979[label="zx48",fontsize=16,color="green",shape="box"];6733[label="zx4470",fontsize=16,color="green",shape="box"];6734[label="zx4460",fontsize=16,color="green",shape="box"];6735[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];6735 -> 6745[label="",style="solid", color="black", weight=3];
6736[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="triangle"];6736 -> 6746[label="",style="solid", color="black", weight=3];
6737 -> 6736[label="",style="dashed", color="red", weight=0];
6737[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="magenta"];6060 -> 1381[label="",style="dashed", color="red", weight=0];
6060[label="index (Integer (Pos (Succ zx380)),Integer (Pos (Succ zx381))) (Integer (Pos (Succ zx381))) + Pos (Succ Zero)",fontsize=16,color="magenta"];6060 -> 6075[label="",style="dashed", color="magenta", weight=3];
1449[label="rangeSize1 (Integer (Pos (Succ zx30000))) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];1449 -> 1564[label="",style="solid", color="black", weight=3];
1450[label="rangeSize0 (Integer (Pos Zero)) (Integer (Pos (Succ zx31000))) True",fontsize=16,color="black",shape="box"];1450 -> 1565[label="",style="solid", color="black", weight=3];
1451 -> 1381[label="",style="dashed", color="red", weight=0];
1451[label="index (Integer (Pos Zero),Integer (Pos Zero)) (Integer (Pos Zero)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1451 -> 1566[label="",style="dashed", color="magenta", weight=3];
1452[label="Pos Zero",fontsize=16,color="green",shape="box"];1453 -> 1381[label="",style="dashed", color="red", weight=0];
1453[label="index (Integer (Pos Zero),Integer (Neg Zero)) (Integer (Neg Zero)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1453 -> 1567[label="",style="dashed", color="magenta", weight=3];
1392[label="index (Integer (Neg (Succ zx30000)),Integer (Pos zx3100)) (Integer (Pos zx3100))",fontsize=16,color="black",shape="box"];1392 -> 1501[label="",style="solid", color="black", weight=3];
6008[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) False))",fontsize=16,color="black",shape="box"];6008 -> 6031[label="",style="solid", color="black", weight=3];
6009[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile1 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];6009 -> 6032[label="",style="solid", color="black", weight=3];
1461[label="rangeSize0 (Integer (Neg (Succ zx30000))) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];1461 -> 1576[label="",style="solid", color="black", weight=3];
1462 -> 1381[label="",style="dashed", color="red", weight=0];
1462[label="index (Integer (Neg Zero),Integer (Pos (Succ zx31000))) (Integer (Pos (Succ zx31000))) + Pos (Succ Zero)",fontsize=16,color="magenta"];1462 -> 1577[label="",style="dashed", color="magenta", weight=3];
1463 -> 1381[label="",style="dashed", color="red", weight=0];
1463[label="index (Integer (Neg Zero),Integer (Pos Zero)) (Integer (Pos Zero)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1463 -> 1578[label="",style="dashed", color="magenta", weight=3];
1464[label="rangeSize1 (Integer (Neg Zero)) (Integer (Neg (Succ zx31000))) True",fontsize=16,color="black",shape="box"];1464 -> 1579[label="",style="solid", color="black", weight=3];
1465 -> 1381[label="",style="dashed", color="red", weight=0];
1465[label="index (Integer (Neg Zero),Integer (Neg Zero)) (Integer (Neg Zero)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1465 -> 1580[label="",style="dashed", color="magenta", weight=3];
1470[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1470 -> 1586[label="",style="solid", color="black", weight=3];
1471[label="[]",fontsize=16,color="green",shape="box"];1472[label="Pos Zero : takeWhile (flip (<=) (Pos (Succ zx31000))) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1472 -> 1587[label="",style="dashed", color="green", weight=3];
1473[label="takeWhile (flip (<=) (Pos Zero)) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1473 -> 1588[label="",style="solid", color="black", weight=3];
1474[label="takeWhile0 (flip (<=) (Neg (Succ zx31000))) (Pos Zero) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1474 -> 1589[label="",style="solid", color="black", weight=3];
1475[label="takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1475 -> 1590[label="",style="solid", color="black", weight=3];
1476[label="takeWhile (flip (<=) (Pos zx3100)) (Neg (Succ zx30000) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Neg (Succ zx30000) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1476 -> 1591[label="",style="solid", color="black", weight=3];
1481[label="Neg (Succ zx30000) : takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1481 -> 1597[label="",style="dashed", color="green", weight=3];
1482[label="takeWhile (flip (<=) (Pos (Succ zx31000))) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1482 -> 1598[label="",style="solid", color="black", weight=3];
1483[label="takeWhile (flip (<=) (Pos Zero)) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1483 -> 1599[label="",style="solid", color="black", weight=3];
1484[label="takeWhile0 (flip (<=) (Neg (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1484 -> 1600[label="",style="solid", color="black", weight=3];
1485[label="takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1485 -> 1601[label="",style="solid", color="black", weight=3];
2366[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx130000) (Succ zx161000) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2366 -> 2374[label="",style="solid", color="black", weight=3];
2367[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx130000) Zero == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2367 -> 2375[label="",style="solid", color="black", weight=3];
2368[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero (Succ zx161000) == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2368 -> 2376[label="",style="solid", color="black", weight=3];
2369[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero Zero == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="black",shape="box"];2369 -> 2377[label="",style="solid", color="black", weight=3];
2370[label="index7 zx30 zx31 zx31 otherwise",fontsize=16,color="black",shape="box"];2370 -> 2378[label="",style="solid", color="black", weight=3];
2371[label="index8 zx30 zx31 zx31 (compare (inRangeI zx31) zx129 /= GT)",fontsize=16,color="black",shape="box"];2371 -> 2379[label="",style="solid", color="black", weight=3];
6646[label="takeWhile0 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) otherwise",fontsize=16,color="black",shape="box"];6646 -> 6740[label="",style="solid", color="black", weight=3];
6647[label="Pos (Succ zx430) : takeWhile (flip (<=) (Pos (Succ zx429))) (numericEnumFrom $! zx431)",fontsize=16,color="green",shape="box"];6647 -> 6741[label="",style="dashed", color="green", weight=3];
5129[label="Pos (Succ zx291)",fontsize=16,color="green",shape="box"];5130[label="Pos (Succ zx292)",fontsize=16,color="green",shape="box"];1393[label="index (Pos Zero,Pos (Succ zx3100)) (Pos (Succ zx3100))",fontsize=16,color="black",shape="box"];1393 -> 1502[label="",style="solid", color="black", weight=3];
1496[label="index13 (Pos Zero,Pos Zero) (Pos Zero)",fontsize=16,color="black",shape="box"];1496 -> 1612[label="",style="solid", color="black", weight=3];
1497[label="index13 (Pos Zero,Neg Zero) (Neg Zero)",fontsize=16,color="black",shape="box"];1497 -> 1613[label="",style="solid", color="black", weight=3];
1516[label="index12 (Neg (Succ zx3000)) (Pos zx310) (Pos zx310) (inRange (Neg (Succ zx3000),Pos zx310) (Pos zx310))",fontsize=16,color="black",shape="box"];1516 -> 1702[label="",style="solid", color="black", weight=3];
6738[label="takeWhile0 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) otherwise",fontsize=16,color="black",shape="box"];6738 -> 6747[label="",style="solid", color="black", weight=3];
6739[label="Neg (Succ zx436) : takeWhile (flip (<=) (Neg (Succ zx435))) (numericEnumFrom $! zx437)",fontsize=16,color="green",shape="box"];6739 -> 6748[label="",style="dashed", color="green", weight=3];
5858[label="Neg (Succ zx353)",fontsize=16,color="green",shape="box"];5859[label="Neg (Succ zx354)",fontsize=16,color="green",shape="box"];1527[label="index (Neg (Succ zx3000),Neg Zero) (Neg Zero)",fontsize=16,color="black",shape="box"];1527 -> 1713[label="",style="solid", color="black", weight=3];
1498[label="index13 (Neg Zero,Pos (Succ zx3100)) (Pos (Succ zx3100))",fontsize=16,color="black",shape="box"];1498 -> 1614[label="",style="solid", color="black", weight=3];
1499[label="index13 (Neg Zero,Pos Zero) (Pos Zero)",fontsize=16,color="black",shape="box"];1499 -> 1615[label="",style="solid", color="black", weight=3];
1500[label="index13 (Neg Zero,Neg Zero) (Neg Zero)",fontsize=16,color="black",shape="box"];1500 -> 1616[label="",style="solid", color="black", weight=3];
1528[label="rangeSize1 LT LT (null ((++) range40 LT (not (EQ == LT)) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1528 -> 1714[label="",style="solid", color="black", weight=3];
1529[label="rangeSize1 EQ LT (null ((++) range40 LT (not (compare1 LT EQ (LT <= EQ) == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1529 -> 1715[label="",style="solid", color="black", weight=3];
1530[label="rangeSize1 GT LT (null ((++) range40 LT (not (compare1 LT GT (LT <= GT) == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1530 -> 1716[label="",style="solid", color="black", weight=3];
1531[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare3 LT zx30 == LT)) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1531 -> 1717[label="",style="solid", color="black", weight=3];
1532[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare3 LT zx30 == LT)) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1532 -> 1718[label="",style="solid", color="black", weight=3];
1533[label="rangeSize1 False False (null ((++) range00 False (not (EQ == LT)) foldr (++) [] (map (range0 False False) (True : []))))",fontsize=16,color="black",shape="box"];1533 -> 1719[label="",style="solid", color="black", weight=3];
1534[label="rangeSize1 True False (null ((++) range00 False (not (compare1 False True (False <= True) == LT)) foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];1534 -> 1720[label="",style="solid", color="black", weight=3];
1535[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare3 False zx30 == LT)) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="black",shape="box"];1535 -> 1721[label="",style="solid", color="black", weight=3];
1536[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx300000) (Succ zx310000) == GT))",fontsize=16,color="black",shape="box"];1536 -> 1722[label="",style="solid", color="black", weight=3];
1537[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx300000) Zero == GT))",fontsize=16,color="black",shape="box"];1537 -> 1723[label="",style="solid", color="black", weight=3];
1538[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1538 -> 1724[label="",style="solid", color="black", weight=3];
1539[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx310000) == GT))",fontsize=16,color="black",shape="box"];1539 -> 1725[label="",style="solid", color="black", weight=3];
1540[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1540 -> 1726[label="",style="solid", color="black", weight=3];
1541[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1541 -> 1727[label="",style="solid", color="black", weight=3];
1542[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1542 -> 1728[label="",style="solid", color="black", weight=3];
1543[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1543 -> 1729[label="",style="solid", color="black", weight=3];
1544[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx310000) (Succ zx300000) == GT))",fontsize=16,color="black",shape="box"];1544 -> 1730[label="",style="solid", color="black", weight=3];
1545[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx300000) == GT))",fontsize=16,color="black",shape="box"];1545 -> 1731[label="",style="solid", color="black", weight=3];
1546[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1546 -> 1732[label="",style="solid", color="black", weight=3];
1547[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1547 -> 1733[label="",style="solid", color="black", weight=3];
1548[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx310000) Zero == GT))",fontsize=16,color="black",shape="box"];1548 -> 1734[label="",style="solid", color="black", weight=3];
1549[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1549 -> 1735[label="",style="solid", color="black", weight=3];
1550[label="(++) range40 LT (LT >= zx300) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1550 -> 1736[label="",style="solid", color="black", weight=3];
1551[label="(++) range40 LT (not (compare0 EQ LT True == LT) && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1551 -> 1737[label="",style="solid", color="black", weight=3];
1552[label="(++) range40 LT (not (compare0 GT LT True == LT) && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1552 -> 1738[label="",style="solid", color="black", weight=3];
1553[label="(++) range00 False (False >= zx300) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];1553 -> 1739[label="",style="solid", color="black", weight=3];
1554[label="(++) range00 False (not (compare0 True False True == LT) && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];1554 -> 1740[label="",style="solid", color="black", weight=3];
1980[label="range ((zx400,zx401,zx402),(zx410,zx411,zx412))",fontsize=16,color="black",shape="box"];1980 -> 2167[label="",style="solid", color="black", weight=3];
1981[label="range ((zx400,zx401),(zx410,zx411))",fontsize=16,color="black",shape="box"];1981 -> 2168[label="",style="solid", color="black", weight=3];
1555[label="concat (map (range1 zx101 zx1040) (range (zx102,zx103)))",fontsize=16,color="black",shape="box"];1555 -> 1741[label="",style="solid", color="black", weight=3];
1982 -> 1400[label="",style="dashed", color="red", weight=0];
1982[label="index (zx642,zx672) zx672 + rangeSize (zx642,zx672) * (index (zx641,zx671) zx671 + rangeSize (zx641,zx671) * index (zx640,zx670) zx670)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];1982 -> 2169[label="",style="dashed", color="magenta", weight=3];
1982 -> 2170[label="",style="dashed", color="magenta", weight=3];
1982 -> 2171[label="",style="dashed", color="magenta", weight=3];
1982 -> 2172[label="",style="dashed", color="magenta", weight=3];
1982 -> 2173[label="",style="dashed", color="magenta", weight=3];
1982 -> 2174[label="",style="dashed", color="magenta", weight=3];
1983 -> 1401[label="",style="dashed", color="red", weight=0];
1983[label="index (zx641,zx671) zx671 + rangeSize (zx641,zx671) * index (zx640,zx670) zx670\n  Ix a  Ix b",fontsize=16,color="magenta"];1983 -> 2175[label="",style="dashed", color="magenta", weight=3];
1983 -> 2176[label="",style="dashed", color="magenta", weight=3];
1983 -> 2177[label="",style="dashed", color="magenta", weight=3];
1983 -> 2178[label="",style="dashed", color="magenta", weight=3];
1984[label="index5 zx64 zx67 zx67 (zx64 <= zx67 && zx67 <= zx67)",fontsize=16,color="black",shape="box"];1984 -> 2179[label="",style="solid", color="black", weight=3];
1985[label="Pos Zero",fontsize=16,color="green",shape="box"];1986[label="index12 zx64 zx67 zx67 (zx64 <= zx67 && zx67 <= zx67)",fontsize=16,color="black",shape="box"];1986 -> 2180[label="",style="solid", color="black", weight=3];
1987[label="index3 zx67 zx64 (not (compare zx67 zx67 == LT) && zx67 >= zx64)",fontsize=16,color="black",shape="box"];1987 -> 2181[label="",style="solid", color="black", weight=3];
1988[label="index2 zx67 zx64 (not (compare zx67 zx67 == LT) && zx67 >= zx64)",fontsize=16,color="black",shape="box"];1988 -> 2182[label="",style="solid", color="black", weight=3];
1989 -> 4[label="",style="dashed", color="red", weight=0];
1989[label="rangeSize (zx137,zx138)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];1989 -> 2183[label="",style="dashed", color="magenta", weight=3];
1990 -> 5[label="",style="dashed", color="red", weight=0];
1990[label="rangeSize (zx137,zx138)\n  Ix a  Ix b",fontsize=16,color="magenta"];1990 -> 2184[label="",style="dashed", color="magenta", weight=3];
1991 -> 6[label="",style="dashed", color="red", weight=0];
1991[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];1991 -> 2185[label="",style="dashed", color="magenta", weight=3];
1992 -> 7[label="",style="dashed", color="red", weight=0];
1992[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];1992 -> 2186[label="",style="dashed", color="magenta", weight=3];
1993 -> 8[label="",style="dashed", color="red", weight=0];
1993[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];1993 -> 2187[label="",style="dashed", color="magenta", weight=3];
1994 -> 9[label="",style="dashed", color="red", weight=0];
1994[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];1994 -> 2188[label="",style="dashed", color="magenta", weight=3];
1995 -> 10[label="",style="dashed", color="red", weight=0];
1995[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];1995 -> 2189[label="",style="dashed", color="magenta", weight=3];
1996 -> 11[label="",style="dashed", color="red", weight=0];
1996[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];1996 -> 2190[label="",style="dashed", color="magenta", weight=3];
1997[label="primPlusInt (Pos zx151) (primMulInt (Pos zx1520) zx153)",fontsize=16,color="burlywood",shape="box"];11390[label="zx153/Pos zx1530",fontsize=10,color="white",style="solid",shape="box"];1997 -> 11390[label="",style="solid", color="burlywood", weight=9];
11390 -> 2191[label="",style="solid", color="burlywood", weight=3];
11391[label="zx153/Neg zx1530",fontsize=10,color="white",style="solid",shape="box"];1997 -> 11391[label="",style="solid", color="burlywood", weight=9];
11391 -> 2192[label="",style="solid", color="burlywood", weight=3];
1998[label="primPlusInt (Pos zx151) (primMulInt (Neg zx1520) zx153)",fontsize=16,color="burlywood",shape="box"];11392[label="zx153/Pos zx1530",fontsize=10,color="white",style="solid",shape="box"];1998 -> 11392[label="",style="solid", color="burlywood", weight=9];
11392 -> 2193[label="",style="solid", color="burlywood", weight=3];
11393[label="zx153/Neg zx1530",fontsize=10,color="white",style="solid",shape="box"];1998 -> 11393[label="",style="solid", color="burlywood", weight=9];
11393 -> 2194[label="",style="solid", color="burlywood", weight=3];
1999 -> 4[label="",style="dashed", color="red", weight=0];
1999[label="rangeSize (zx137,zx138)\n  Ix a  Ix b  Ix c",fontsize=16,color="magenta"];1999 -> 2195[label="",style="dashed", color="magenta", weight=3];
2000 -> 5[label="",style="dashed", color="red", weight=0];
2000[label="rangeSize (zx137,zx138)\n  Ix a  Ix b",fontsize=16,color="magenta"];2000 -> 2196[label="",style="dashed", color="magenta", weight=3];
2001 -> 6[label="",style="dashed", color="red", weight=0];
2001[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];2001 -> 2197[label="",style="dashed", color="magenta", weight=3];
2002 -> 7[label="",style="dashed", color="red", weight=0];
2002[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];2002 -> 2198[label="",style="dashed", color="magenta", weight=3];
2003 -> 8[label="",style="dashed", color="red", weight=0];
2003[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];2003 -> 2199[label="",style="dashed", color="magenta", weight=3];
2004 -> 9[label="",style="dashed", color="red", weight=0];
2004[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];2004 -> 2200[label="",style="dashed", color="magenta", weight=3];
2005 -> 10[label="",style="dashed", color="red", weight=0];
2005[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];2005 -> 2201[label="",style="dashed", color="magenta", weight=3];
2006 -> 11[label="",style="dashed", color="red", weight=0];
2006[label="rangeSize (zx137,zx138)",fontsize=16,color="magenta"];2006 -> 2202[label="",style="dashed", color="magenta", weight=3];
2007[label="primPlusInt (Neg zx158) (primMulInt (Pos zx1590) zx160)",fontsize=16,color="burlywood",shape="box"];11402[label="zx160/Pos zx1600",fontsize=10,color="white",style="solid",shape="box"];2007 -> 11402[label="",style="solid", color="burlywood", weight=9];
11402 -> 2203[label="",style="solid", color="burlywood", weight=3];
11403[label="zx160/Neg zx1600",fontsize=10,color="white",style="solid",shape="box"];2007 -> 11403[label="",style="solid", color="burlywood", weight=9];
11403 -> 2204[label="",style="solid", color="burlywood", weight=3];
2008[label="primPlusInt (Neg zx158) (primMulInt (Neg zx1590) zx160)",fontsize=16,color="burlywood",shape="box"];11404[label="zx160/Pos zx1600",fontsize=10,color="white",style="solid",shape="box"];2008 -> 11404[label="",style="solid", color="burlywood", weight=9];
11404 -> 2205[label="",style="solid", color="burlywood", weight=3];
11405[label="zx160/Neg zx1600",fontsize=10,color="white",style="solid",shape="box"];2008 -> 11405[label="",style="solid", color="burlywood", weight=9];
11405 -> 2206[label="",style="solid", color="burlywood", weight=3];
6745[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];6745 -> 6887[label="",style="solid", color="black", weight=3];
6746[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];6746 -> 6888[label="",style="solid", color="black", weight=3];
6075 -> 1663[label="",style="dashed", color="red", weight=0];
6075[label="index (Integer (Pos (Succ zx380)),Integer (Pos (Succ zx381))) (Integer (Pos (Succ zx381)))",fontsize=16,color="magenta"];6075 -> 6094[label="",style="dashed", color="magenta", weight=3];
6075 -> 6095[label="",style="dashed", color="magenta", weight=3];
1564[label="Pos Zero",fontsize=16,color="green",shape="box"];1565 -> 1381[label="",style="dashed", color="red", weight=0];
1565[label="index (Integer (Pos Zero),Integer (Pos (Succ zx31000))) (Integer (Pos (Succ zx31000))) + Pos (Succ Zero)",fontsize=16,color="magenta"];1565 -> 1752[label="",style="dashed", color="magenta", weight=3];
1566[label="index (Integer (Pos Zero),Integer (Pos Zero)) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];1566 -> 1753[label="",style="solid", color="black", weight=3];
1567[label="index (Integer (Pos Zero),Integer (Neg Zero)) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1567 -> 1754[label="",style="solid", color="black", weight=3];
1501[label="index6 (Integer (Neg (Succ zx30000)),Integer (Pos zx3100)) (Integer (Pos zx3100))",fontsize=16,color="black",shape="box"];1501 -> 1617[label="",style="solid", color="black", weight=3];
6031[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile0 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) otherwise))",fontsize=16,color="black",shape="box"];6031 -> 6047[label="",style="solid", color="black", weight=3];
6032[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (Integer (Neg (Succ zx385)) : takeWhile (flip (<=) (Integer (Neg (Succ zx386)))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];6032 -> 6048[label="",style="solid", color="black", weight=3];
1576 -> 1381[label="",style="dashed", color="red", weight=0];
1576[label="index (Integer (Neg (Succ zx30000)),Integer (Neg Zero)) (Integer (Neg Zero)) + Pos (Succ Zero)",fontsize=16,color="magenta"];1576 -> 1765[label="",style="dashed", color="magenta", weight=3];
1577[label="index (Integer (Neg Zero),Integer (Pos (Succ zx31000))) (Integer (Pos (Succ zx31000)))",fontsize=16,color="black",shape="box"];1577 -> 1766[label="",style="solid", color="black", weight=3];
1578[label="index (Integer (Neg Zero),Integer (Pos Zero)) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];1578 -> 1767[label="",style="solid", color="black", weight=3];
1579[label="Pos Zero",fontsize=16,color="green",shape="box"];1580[label="index (Integer (Neg Zero),Integer (Neg Zero)) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1580 -> 1768[label="",style="solid", color="black", weight=3];
1586[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ zx30000)) (numericEnumFrom $! Pos (Succ zx30000) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1586 -> 1776[label="",style="solid", color="black", weight=3];
1587[label="takeWhile (flip (<=) (Pos (Succ zx31000))) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1587 -> 1777[label="",style="solid", color="black", weight=3];
1588[label="takeWhile (flip (<=) (Pos Zero)) (Pos Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1588 -> 1778[label="",style="solid", color="black", weight=3];
1589[label="[]",fontsize=16,color="green",shape="box"];1590[label="takeWhile (flip (<=) (Neg Zero)) (Pos Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1590 -> 1779[label="",style="solid", color="black", weight=3];
1591 -> 2240[label="",style="dashed", color="red", weight=0];
1591[label="takeWhile (flip (<=) (Pos zx3100)) (enforceWHNF (WHNF (Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];1591 -> 2241[label="",style="dashed", color="magenta", weight=3];
1591 -> 2242[label="",style="dashed", color="magenta", weight=3];
1597[label="takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom $! Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1597 -> 1788[label="",style="solid", color="black", weight=3];
1598[label="takeWhile (flip (<=) (Pos (Succ zx31000))) (Neg Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Neg Zero + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1598 -> 1789[label="",style="solid", color="black", weight=3];
1599[label="takeWhile (flip (<=) (Pos Zero)) (Neg Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Neg Zero + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1599 -> 1790[label="",style="solid", color="black", weight=3];
1600[label="takeWhile0 (flip (<=) (Neg (Succ zx31000))) (Neg Zero) (numericEnumFrom $! Neg Zero + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1600 -> 1791[label="",style="solid", color="black", weight=3];
1601[label="takeWhile (flip (<=) (Neg Zero)) (Neg Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Neg Zero + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1601 -> 1792[label="",style="solid", color="black", weight=3];
2374 -> 2345[label="",style="dashed", color="red", weight=0];
2374[label="index8 zx30 zx31 zx31 (not (primCmpNat zx130000 zx161000 == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2374 -> 2395[label="",style="dashed", color="magenta", weight=3];
2374 -> 2396[label="",style="dashed", color="magenta", weight=3];
2375 -> 2275[label="",style="dashed", color="red", weight=0];
2375[label="index8 zx30 zx31 zx31 (not (GT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2376 -> 2280[label="",style="dashed", color="red", weight=0];
2376[label="index8 zx30 zx31 zx31 (not (LT == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2377 -> 2309[label="",style="dashed", color="red", weight=0];
2377[label="index8 zx30 zx31 zx31 (not (EQ == GT) && inRangeI zx31 <= zx129)",fontsize=16,color="magenta"];2378[label="index7 zx30 zx31 zx31 True",fontsize=16,color="black",shape="box"];2378 -> 2397[label="",style="solid", color="black", weight=3];
2379[label="index8 zx30 zx31 zx31 (not (compare (inRangeI zx31) zx129 == GT))",fontsize=16,color="black",shape="box"];2379 -> 2398[label="",style="solid", color="black", weight=3];
6740[label="takeWhile0 (flip (<=) (Pos (Succ zx429))) (Pos (Succ zx430)) (numericEnumFrom $! zx431) True",fontsize=16,color="black",shape="box"];6740 -> 6749[label="",style="solid", color="black", weight=3];
6741[label="takeWhile (flip (<=) (Pos (Succ zx429))) (numericEnumFrom $! zx431)",fontsize=16,color="black",shape="box"];6741 -> 6750[label="",style="solid", color="black", weight=3];
1502[label="index13 (Pos Zero,Pos (Succ zx3100)) (Pos (Succ zx3100))",fontsize=16,color="black",shape="box"];1502 -> 1618[label="",style="solid", color="black", weight=3];
1612[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (inRange (Pos Zero,Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];1612 -> 1804[label="",style="solid", color="black", weight=3];
1613[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (inRange (Pos Zero,Neg Zero) (Neg Zero))",fontsize=16,color="black",shape="box"];1613 -> 1805[label="",style="solid", color="black", weight=3];
1702[label="index12 (Neg (Succ zx3000)) (Pos zx310) (Pos zx310) (Neg (Succ zx3000) <= Pos zx310 && Pos zx310 <= Pos zx310)",fontsize=16,color="black",shape="box"];1702 -> 1881[label="",style="solid", color="black", weight=3];
6747[label="takeWhile0 (flip (<=) (Neg (Succ zx435))) (Neg (Succ zx436)) (numericEnumFrom $! zx437) True",fontsize=16,color="black",shape="box"];6747 -> 6889[label="",style="solid", color="black", weight=3];
6748[label="takeWhile (flip (<=) (Neg (Succ zx435))) (numericEnumFrom $! zx437)",fontsize=16,color="black",shape="box"];6748 -> 6890[label="",style="solid", color="black", weight=3];
1713[label="index13 (Neg (Succ zx3000),Neg Zero) (Neg Zero)",fontsize=16,color="black",shape="box"];1713 -> 1893[label="",style="solid", color="black", weight=3];
1614[label="index12 (Neg Zero) (Pos (Succ zx3100)) (Pos (Succ zx3100)) (inRange (Neg Zero,Pos (Succ zx3100)) (Pos (Succ zx3100)))",fontsize=16,color="black",shape="box"];1614 -> 1806[label="",style="solid", color="black", weight=3];
1615[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (inRange (Neg Zero,Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];1615 -> 1807[label="",style="solid", color="black", weight=3];
1616[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (inRange (Neg Zero,Neg Zero) (Neg Zero))",fontsize=16,color="black",shape="box"];1616 -> 1808[label="",style="solid", color="black", weight=3];
1714[label="rangeSize1 LT LT (null ((++) range40 LT (not False) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1714 -> 1894[label="",style="solid", color="black", weight=3];
1715[label="rangeSize1 EQ LT (null ((++) range40 LT (not (compare1 LT EQ True == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1715 -> 1895[label="",style="solid", color="black", weight=3];
1716[label="rangeSize1 GT LT (null ((++) range40 LT (not (compare1 LT GT True == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1716 -> 1896[label="",style="solid", color="black", weight=3];
1717[label="rangeSize1 zx30 EQ (null ((++) range40 LT (not (compare2 LT zx30 (LT == zx30) == LT)) foldr (++) [] (map (range4 EQ zx30) (EQ : GT : []))))",fontsize=16,color="burlywood",shape="box"];11414[label="zx30/LT",fontsize=10,color="white",style="solid",shape="box"];1717 -> 11414[label="",style="solid", color="burlywood", weight=9];
11414 -> 1897[label="",style="solid", color="burlywood", weight=3];
11415[label="zx30/EQ",fontsize=10,color="white",style="solid",shape="box"];1717 -> 11415[label="",style="solid", color="burlywood", weight=9];
11415 -> 1898[label="",style="solid", color="burlywood", weight=3];
11416[label="zx30/GT",fontsize=10,color="white",style="solid",shape="box"];1717 -> 11416[label="",style="solid", color="burlywood", weight=9];
11416 -> 1899[label="",style="solid", color="burlywood", weight=3];
1718[label="rangeSize1 zx30 GT (null ((++) range40 LT (not (compare2 LT zx30 (LT == zx30) == LT)) foldr (++) [] (map (range4 GT zx30) (EQ : GT : []))))",fontsize=16,color="burlywood",shape="box"];11417[label="zx30/LT",fontsize=10,color="white",style="solid",shape="box"];1718 -> 11417[label="",style="solid", color="burlywood", weight=9];
11417 -> 1900[label="",style="solid", color="burlywood", weight=3];
11418[label="zx30/EQ",fontsize=10,color="white",style="solid",shape="box"];1718 -> 11418[label="",style="solid", color="burlywood", weight=9];
11418 -> 1901[label="",style="solid", color="burlywood", weight=3];
11419[label="zx30/GT",fontsize=10,color="white",style="solid",shape="box"];1718 -> 11419[label="",style="solid", color="burlywood", weight=9];
11419 -> 1902[label="",style="solid", color="burlywood", weight=3];
1719[label="rangeSize1 False False (null ((++) range00 False (not False) foldr (++) [] (map (range0 False False) (True : []))))",fontsize=16,color="black",shape="box"];1719 -> 1903[label="",style="solid", color="black", weight=3];
1720[label="rangeSize1 True False (null ((++) range00 False (not (compare1 False True True == LT)) foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];1720 -> 1904[label="",style="solid", color="black", weight=3];
1721[label="rangeSize1 zx30 True (null ((++) range00 False (not (compare2 False zx30 (False == zx30) == LT)) foldr (++) [] (map (range0 True zx30) (True : []))))",fontsize=16,color="burlywood",shape="box"];11420[label="zx30/False",fontsize=10,color="white",style="solid",shape="box"];1721 -> 11420[label="",style="solid", color="burlywood", weight=9];
11420 -> 1905[label="",style="solid", color="burlywood", weight=3];
11421[label="zx30/True",fontsize=10,color="white",style="solid",shape="box"];1721 -> 11421[label="",style="solid", color="burlywood", weight=9];
11421 -> 1906[label="",style="solid", color="burlywood", weight=3];
1722 -> 6518[label="",style="dashed", color="red", weight=0];
1722[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx300000 zx310000 == GT))",fontsize=16,color="magenta"];1722 -> 6523[label="",style="dashed", color="magenta", weight=3];
1722 -> 6524[label="",style="dashed", color="magenta", weight=3];
1722 -> 6525[label="",style="dashed", color="magenta", weight=3];
1722 -> 6526[label="",style="dashed", color="magenta", weight=3];
1723[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1723 -> 1909[label="",style="solid", color="black", weight=3];
1724[label="takeWhile1 (flip (<=) (Integer (Neg zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1724 -> 1910[label="",style="solid", color="black", weight=3];
1725[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1725 -> 1911[label="",style="solid", color="black", weight=3];
1726[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1726 -> 1912[label="",style="solid", color="black", weight=3];
1727[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1727 -> 1913[label="",style="solid", color="black", weight=3];
1728[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1728 -> 1914[label="",style="solid", color="black", weight=3];
1729[label="takeWhile1 (flip (<=) (Integer (Pos zx31000))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1729 -> 1915[label="",style="solid", color="black", weight=3];
1730 -> 7349[label="",style="dashed", color="red", weight=0];
1730[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx310000 zx300000 == GT))",fontsize=16,color="magenta"];1730 -> 7350[label="",style="dashed", color="magenta", weight=3];
1730 -> 7351[label="",style="dashed", color="magenta", weight=3];
1730 -> 7352[label="",style="dashed", color="magenta", weight=3];
1730 -> 7353[label="",style="dashed", color="magenta", weight=3];
1731[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1731 -> 1918[label="",style="solid", color="black", weight=3];
1732[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1732 -> 1919[label="",style="solid", color="black", weight=3];
1733[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1733 -> 1920[label="",style="solid", color="black", weight=3];
1734[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1734 -> 1921[label="",style="solid", color="black", weight=3];
1735[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1735 -> 1922[label="",style="solid", color="black", weight=3];
1736[label="(++) range40 LT (compare LT zx300 /= LT) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1736 -> 1923[label="",style="solid", color="black", weight=3];
1737[label="(++) range40 LT (not (GT == LT) && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1737 -> 1924[label="",style="solid", color="black", weight=3];
1738[label="(++) range40 LT (not (GT == LT) && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1738 -> 1925[label="",style="solid", color="black", weight=3];
1739[label="(++) range00 False (compare False zx300 /= LT) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];1739 -> 1926[label="",style="solid", color="black", weight=3];
1740[label="(++) range00 False (not (GT == LT) && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];1740 -> 1927[label="",style="solid", color="black", weight=3];
2167[label="concatMap (range3 zx402 zx412 zx401 zx411) (range (zx400,zx410))",fontsize=16,color="black",shape="box"];2167 -> 2286[label="",style="solid", color="black", weight=3];
2168[label="concatMap (range6 zx401 zx411) (range (zx400,zx410))",fontsize=16,color="black",shape="box"];2168 -> 2287[label="",style="solid", color="black", weight=3];
1741 -> 1928[label="",style="dashed", color="red", weight=0];
1741[label="foldr (++) [] (map (range1 zx101 zx1040) (range (zx102,zx103)))",fontsize=16,color="magenta"];1741 -> 1929[label="",style="dashed", color="magenta", weight=3];
1741 -> 1930[label="",style="dashed", color="magenta", weight=3];
1741 -> 1931[label="",style="dashed", color="magenta", weight=3];
2169[label="zx670\n  Ix a",fontsize=16,color="green",shape="box"];2170[label="zx671\n  Ix a",fontsize=16,color="green",shape="box"];2171[label="zx642\n  Ix a",fontsize=16,color="green",shape="box"];2172[label="zx672\n  Ix a",fontsize=16,color="green",shape="box"];2173[label="zx641\n  Ix a",fontsize=16,color="green",shape="box"];2174[label="zx640\n  Ix a",fontsize=16,color="green",shape="box"];2175[label="zx670\n  Ix a",fontsize=16,color="green",shape="box"];2176[label="zx640\n  Ix a",fontsize=16,color="green",shape="box"];2177[label="zx641\n  Ix a",fontsize=16,color="green",shape="box"];2178[label="zx671\n  Ix a",fontsize=16,color="green",shape="box"];2179[label="index5 zx64 zx67 zx67 (compare zx64 zx67 /= GT && zx67 <= zx67)",fontsize=16,color="black",shape="triangle"];2179 -> 2288[label="",style="solid", color="black", weight=3];
2180[label="index12 zx64 zx67 zx67 (compare zx64 zx67 /= GT && zx67 <= zx67)",fontsize=16,color="black",shape="triangle"];2180 -> 2289[label="",style="solid", color="black", weight=3];
2181[label="index3 zx67 zx64 (not (compare3 zx67 zx67 == LT) && zx67 >= zx64)",fontsize=16,color="black",shape="box"];2181 -> 2290[label="",style="solid", color="black", weight=3];
2182[label="index2 zx67 zx64 (not (compare3 zx67 zx67 == LT) && zx67 >= zx64)",fontsize=16,color="black",shape="box"];2182 -> 2291[label="",style="solid", color="black", weight=3];
2183[label="(zx137,zx138)\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];2184[label="(zx137,zx138)\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];2185[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2186[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2187[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2188[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2189[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2190[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2191[label="primPlusInt (Pos zx151) (primMulInt (Pos zx1520) (Pos zx1530))",fontsize=16,color="black",shape="box"];2191 -> 2292[label="",style="solid", color="black", weight=3];
2192[label="primPlusInt (Pos zx151) (primMulInt (Pos zx1520) (Neg zx1530))",fontsize=16,color="black",shape="box"];2192 -> 2293[label="",style="solid", color="black", weight=3];
2193[label="primPlusInt (Pos zx151) (primMulInt (Neg zx1520) (Pos zx1530))",fontsize=16,color="black",shape="box"];2193 -> 2294[label="",style="solid", color="black", weight=3];
2194[label="primPlusInt (Pos zx151) (primMulInt (Neg zx1520) (Neg zx1530))",fontsize=16,color="black",shape="box"];2194 -> 2295[label="",style="solid", color="black", weight=3];
2195[label="(zx137,zx138)\n  Ix a  Ix b  Ix c",fontsize=16,color="green",shape="box"];2196[label="(zx137,zx138)\n  Ix a  Ix b",fontsize=16,color="green",shape="box"];2197[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2198[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2199[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2200[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2201[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2202[label="(zx137,zx138)",fontsize=16,color="green",shape="box"];2203[label="primPlusInt (Neg zx158) (primMulInt (Pos zx1590) (Pos zx1600))",fontsize=16,color="black",shape="box"];2203 -> 2296[label="",style="solid", color="black", weight=3];
2204[label="primPlusInt (Neg zx158) (primMulInt (Pos zx1590) (Neg zx1600))",fontsize=16,color="black",shape="box"];2204 -> 2297[label="",style="solid", color="black", weight=3];
2205[label="primPlusInt (Neg zx158) (primMulInt (Neg zx1590) (Pos zx1600))",fontsize=16,color="black",shape="box"];2205 -> 2298[label="",style="solid", color="black", weight=3];
2206[label="primPlusInt (Neg zx158) (primMulInt (Neg zx1590) (Neg zx1600))",fontsize=16,color="black",shape="box"];2206 -> 2299[label="",style="solid", color="black", weight=3];
6887[label="takeWhile0 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];6887 -> 6997[label="",style="solid", color="black", weight=3];
6888[label="Integer (Pos (Succ zx445)) : takeWhile (flip (<=) (Integer (Pos (Succ zx444)))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];6888 -> 6998[label="",style="dashed", color="green", weight=3];
6094[label="Integer (Pos (Succ zx380))",fontsize=16,color="green",shape="box"];6095[label="Integer (Pos (Succ zx381))",fontsize=16,color="green",shape="box"];1752 -> 1663[label="",style="dashed", color="red", weight=0];
1752[label="index (Integer (Pos Zero),Integer (Pos (Succ zx31000))) (Integer (Pos (Succ zx31000)))",fontsize=16,color="magenta"];1752 -> 2019[label="",style="dashed", color="magenta", weight=3];
1752 -> 2020[label="",style="dashed", color="magenta", weight=3];
1753 -> 1818[label="",style="dashed", color="red", weight=0];
1753[label="index6 (Integer (Pos Zero),Integer (Pos Zero)) (Integer (Pos Zero))",fontsize=16,color="magenta"];1753 -> 2021[label="",style="dashed", color="magenta", weight=3];
1753 -> 2022[label="",style="dashed", color="magenta", weight=3];
1754 -> 1818[label="",style="dashed", color="red", weight=0];
1754[label="index6 (Integer (Pos Zero),Integer (Neg Zero)) (Integer (Neg Zero))",fontsize=16,color="magenta"];1754 -> 2023[label="",style="dashed", color="magenta", weight=3];
1754 -> 2024[label="",style="dashed", color="magenta", weight=3];
1617[label="index5 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (Integer (Pos zx3100)) (inRange (Integer (Neg (Succ zx30000)),Integer (Pos zx3100)) (Integer (Pos zx3100)))",fontsize=16,color="black",shape="box"];1617 -> 1809[label="",style="solid", color="black", weight=3];
6047[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null (takeWhile0 (flip (<=) (Integer (Neg (Succ zx386)))) (Integer (Neg (Succ zx385))) (numericEnumFrom $! Integer (Neg (Succ zx385)) + fromInt (Pos (Succ Zero))) True))",fontsize=16,color="black",shape="box"];6047 -> 6061[label="",style="solid", color="black", weight=3];
6048[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) False",fontsize=16,color="black",shape="box"];6048 -> 6062[label="",style="solid", color="black", weight=3];
1765 -> 1663[label="",style="dashed", color="red", weight=0];
1765[label="index (Integer (Neg (Succ zx30000)),Integer (Neg Zero)) (Integer (Neg Zero))",fontsize=16,color="magenta"];1765 -> 2035[label="",style="dashed", color="magenta", weight=3];
1765 -> 2036[label="",style="dashed", color="magenta", weight=3];
1766 -> 1818[label="",style="dashed", color="red", weight=0];
1766[label="index6 (Integer (Neg Zero),Integer (Pos (Succ zx31000))) (Integer (Pos (Succ zx31000)))",fontsize=16,color="magenta"];1766 -> 2037[label="",style="dashed", color="magenta", weight=3];
1766 -> 2038[label="",style="dashed", color="magenta", weight=3];
1767 -> 1818[label="",style="dashed", color="red", weight=0];
1767[label="index6 (Integer (Neg Zero),Integer (Pos Zero)) (Integer (Pos Zero))",fontsize=16,color="magenta"];1767 -> 2039[label="",style="dashed", color="magenta", weight=3];
1767 -> 2040[label="",style="dashed", color="magenta", weight=3];
1768 -> 1818[label="",style="dashed", color="red", weight=0];
1768[label="index6 (Integer (Neg Zero),Integer (Neg Zero)) (Integer (Neg Zero))",fontsize=16,color="magenta"];1768 -> 2041[label="",style="dashed", color="magenta", weight=3];
1768 -> 2042[label="",style="dashed", color="magenta", weight=3];
1776[label="[]",fontsize=16,color="green",shape="box"];1777[label="takeWhile (flip (<=) (Pos (Succ zx31000))) (Pos Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1777 -> 2050[label="",style="solid", color="black", weight=3];
1778 -> 2240[label="",style="dashed", color="red", weight=0];
1778[label="takeWhile (flip (<=) (Pos Zero)) (enforceWHNF (WHNF (Pos Zero + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];1778 -> 2243[label="",style="dashed", color="magenta", weight=3];
1778 -> 2244[label="",style="dashed", color="magenta", weight=3];
1778 -> 2245[label="",style="dashed", color="magenta", weight=3];
1779 -> 2382[label="",style="dashed", color="red", weight=0];
1779[label="takeWhile (flip (<=) (Neg Zero)) (enforceWHNF (WHNF (Pos Zero + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];1779 -> 2383[label="",style="dashed", color="magenta", weight=3];
1779 -> 2384[label="",style="dashed", color="magenta", weight=3];
2242 -> 2241[label="",style="dashed", color="red", weight=0];
2242[label="Neg (Succ zx30000) + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2240[label="takeWhile (flip (<=) (Pos zx3100)) (enforceWHNF (WHNF zx166) (numericEnumFrom zx165))",fontsize=16,color="black",shape="triangle"];2240 -> 2301[label="",style="solid", color="black", weight=3];
1788[label="takeWhile (flip (<=) (Neg Zero)) (Neg (Succ zx30000) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Neg (Succ zx30000) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1788 -> 2061[label="",style="solid", color="black", weight=3];
1789 -> 2240[label="",style="dashed", color="red", weight=0];
1789[label="takeWhile (flip (<=) (Pos (Succ zx31000))) (enforceWHNF (WHNF (Neg Zero + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Neg Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];1789 -> 2248[label="",style="dashed", color="magenta", weight=3];
1789 -> 2249[label="",style="dashed", color="magenta", weight=3];
1789 -> 2250[label="",style="dashed", color="magenta", weight=3];
1790 -> 2240[label="",style="dashed", color="red", weight=0];
1790[label="takeWhile (flip (<=) (Pos Zero)) (enforceWHNF (WHNF (Neg Zero + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Neg Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];1790 -> 2251[label="",style="dashed", color="magenta", weight=3];
1790 -> 2252[label="",style="dashed", color="magenta", weight=3];
1790 -> 2253[label="",style="dashed", color="magenta", weight=3];
1791[label="[]",fontsize=16,color="green",shape="box"];1792 -> 2382[label="",style="dashed", color="red", weight=0];
1792[label="takeWhile (flip (<=) (Neg Zero)) (enforceWHNF (WHNF (Neg Zero + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Neg Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];1792 -> 2385[label="",style="dashed", color="magenta", weight=3];
1792 -> 2386[label="",style="dashed", color="magenta", weight=3];
2395[label="zx161000",fontsize=16,color="green",shape="box"];2396[label="zx130000",fontsize=16,color="green",shape="box"];2397[label="error []",fontsize=16,color="black",shape="triangle"];2397 -> 2427[label="",style="solid", color="black", weight=3];
2398 -> 2431[label="",style="dashed", color="red", weight=0];
2398[label="index8 zx30 zx31 zx31 (not (primCmpInt (inRangeI zx31) zx129 == GT))",fontsize=16,color="magenta"];2398 -> 2432[label="",style="dashed", color="magenta", weight=3];
6749[label="[]",fontsize=16,color="green",shape="box"];6750[label="takeWhile (flip (<=) (Pos (Succ zx429))) (zx431 `seq` numericEnumFrom zx431)",fontsize=16,color="black",shape="box"];6750 -> 6891[label="",style="solid", color="black", weight=3];
1618[label="index12 (Pos Zero) (Pos (Succ zx3100)) (Pos (Succ zx3100)) (inRange (Pos Zero,Pos (Succ zx3100)) (Pos (Succ zx3100)))",fontsize=16,color="black",shape="box"];1618 -> 1810[label="",style="solid", color="black", weight=3];
1804[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (Pos Zero <= Pos Zero && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];1804 -> 2077[label="",style="solid", color="black", weight=3];
1805[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (Pos Zero <= Neg Zero && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];1805 -> 2078[label="",style="solid", color="black", weight=3];
1881[label="index12 (Neg (Succ zx3000)) (Pos zx310) (Pos zx310) (compare (Neg (Succ zx3000)) (Pos zx310) /= GT && Pos zx310 <= Pos zx310)",fontsize=16,color="black",shape="box"];1881 -> 2079[label="",style="solid", color="black", weight=3];
6889[label="[]",fontsize=16,color="green",shape="box"];6890[label="takeWhile (flip (<=) (Neg (Succ zx435))) (zx437 `seq` numericEnumFrom zx437)",fontsize=16,color="black",shape="box"];6890 -> 6999[label="",style="solid", color="black", weight=3];
1893 -> 1941[label="",style="dashed", color="red", weight=0];
1893[label="index12 (Neg (Succ zx3000)) (Neg Zero) (Neg Zero) (inRange (Neg (Succ zx3000),Neg Zero) (Neg Zero))",fontsize=16,color="magenta"];1893 -> 2092[label="",style="dashed", color="magenta", weight=3];
1893 -> 2093[label="",style="dashed", color="magenta", weight=3];
1806[label="index12 (Neg Zero) (Pos (Succ zx3100)) (Pos (Succ zx3100)) (Neg Zero <= Pos (Succ zx3100) && Pos (Succ zx3100) <= Pos (Succ zx3100))",fontsize=16,color="black",shape="box"];1806 -> 2094[label="",style="solid", color="black", weight=3];
1807[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (Neg Zero <= Pos Zero && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];1807 -> 2095[label="",style="solid", color="black", weight=3];
1808[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (Neg Zero <= Neg Zero && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];1808 -> 2096[label="",style="solid", color="black", weight=3];
1894[label="rangeSize1 LT LT (null ((++) range40 LT True foldr (++) [] (map (range4 LT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1894 -> 2097[label="",style="solid", color="black", weight=3];
1895[label="rangeSize1 EQ LT (null ((++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1895 -> 2098[label="",style="solid", color="black", weight=3];
1896[label="rangeSize1 GT LT (null ((++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1896 -> 2099[label="",style="solid", color="black", weight=3];
1897[label="rangeSize1 LT EQ (null ((++) range40 LT (not (compare2 LT LT (LT == LT) == LT)) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1897 -> 2100[label="",style="solid", color="black", weight=3];
1898[label="rangeSize1 EQ EQ (null ((++) range40 LT (not (compare2 LT EQ (LT == EQ) == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1898 -> 2101[label="",style="solid", color="black", weight=3];
1899[label="rangeSize1 GT EQ (null ((++) range40 LT (not (compare2 LT GT (LT == GT) == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1899 -> 2102[label="",style="solid", color="black", weight=3];
1900[label="rangeSize1 LT GT (null ((++) range40 LT (not (compare2 LT LT (LT == LT) == LT)) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1900 -> 2103[label="",style="solid", color="black", weight=3];
1901[label="rangeSize1 EQ GT (null ((++) range40 LT (not (compare2 LT EQ (LT == EQ) == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1901 -> 2104[label="",style="solid", color="black", weight=3];
1902[label="rangeSize1 GT GT (null ((++) range40 LT (not (compare2 LT GT (LT == GT) == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];1902 -> 2105[label="",style="solid", color="black", weight=3];
1903[label="rangeSize1 False False (null ((++) range00 False True foldr (++) [] (map (range0 False False) (True : []))))",fontsize=16,color="black",shape="box"];1903 -> 2106[label="",style="solid", color="black", weight=3];
1904[label="rangeSize1 True False (null ((++) range00 False (not (LT == LT)) foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];1904 -> 2107[label="",style="solid", color="black", weight=3];
1905[label="rangeSize1 False True (null ((++) range00 False (not (compare2 False False (False == False) == LT)) foldr (++) [] (map (range0 True False) (True : []))))",fontsize=16,color="black",shape="box"];1905 -> 2108[label="",style="solid", color="black", weight=3];
1906[label="rangeSize1 True True (null ((++) range00 False (not (compare2 False True (False == True) == LT)) foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];1906 -> 2109[label="",style="solid", color="black", weight=3];
6523[label="zx300000",fontsize=16,color="green",shape="box"];6524[label="zx310000",fontsize=16,color="green",shape="box"];6525[label="zx300000",fontsize=16,color="green",shape="box"];6526[label="zx310000",fontsize=16,color="green",shape="box"];1909[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1909 -> 2114[label="",style="solid", color="black", weight=3];
1910[label="takeWhile0 (flip (<=) (Integer (Neg zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1910 -> 2115[label="",style="solid", color="black", weight=3];
1911[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1911 -> 2116[label="",style="solid", color="black", weight=3];
1912[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1912 -> 2117[label="",style="solid", color="black", weight=3];
1913[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1913 -> 2118[label="",style="solid", color="black", weight=3];
1914[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1914 -> 2119[label="",style="solid", color="black", weight=3];
1915[label="Integer (Neg (Succ zx300000)) : takeWhile (flip (<=) (Integer (Pos zx31000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1915 -> 2120[label="",style="dashed", color="green", weight=3];
7350[label="zx300000",fontsize=16,color="green",shape="box"];7351[label="zx300000",fontsize=16,color="green",shape="box"];7352[label="zx310000",fontsize=16,color="green",shape="box"];7353[label="zx310000",fontsize=16,color="green",shape="box"];7349[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx489 zx490 == GT))",fontsize=16,color="burlywood",shape="triangle"];11440[label="zx489/Succ zx4890",fontsize=10,color="white",style="solid",shape="box"];7349 -> 11440[label="",style="solid", color="burlywood", weight=9];
11440 -> 7390[label="",style="solid", color="burlywood", weight=3];
11441[label="zx489/Zero",fontsize=10,color="white",style="solid",shape="box"];7349 -> 11441[label="",style="solid", color="burlywood", weight=9];
11441 -> 7391[label="",style="solid", color="burlywood", weight=3];
1918[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1918 -> 2125[label="",style="solid", color="black", weight=3];
1919[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1919 -> 2126[label="",style="solid", color="black", weight=3];
1920[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1920 -> 2127[label="",style="solid", color="black", weight=3];
1921[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1921 -> 2128[label="",style="solid", color="black", weight=3];
1922[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1922 -> 2129[label="",style="solid", color="black", weight=3];
1923[label="(++) range40 LT (not (compare LT zx300 == LT)) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1923 -> 2130[label="",style="solid", color="black", weight=3];
1924[label="(++) range40 LT (not False && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1924 -> 2131[label="",style="solid", color="black", weight=3];
1925[label="(++) range40 LT (not False && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];1925 -> 2132[label="",style="solid", color="black", weight=3];
1926[label="(++) range00 False (not (compare False zx300 == LT)) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];1926 -> 2133[label="",style="solid", color="black", weight=3];
1927[label="(++) range00 False (not False && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];1927 -> 2134[label="",style="solid", color="black", weight=3];
2286[label="concat . map (range3 zx402 zx412 zx401 zx411)",fontsize=16,color="black",shape="box"];2286 -> 2319[label="",style="solid", color="black", weight=3];
2287[label="concat . map (range6 zx401 zx411)",fontsize=16,color="black",shape="box"];2287 -> 2320[label="",style="solid", color="black", weight=3];
1929[label="zx1040",fontsize=16,color="green",shape="box"];1930[label="range (zx102,zx103)",fontsize=16,color="blue",shape="box"];11442[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11442[label="",style="solid", color="blue", weight=9];
11442 -> 2135[label="",style="solid", color="blue", weight=3];
11443[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11443[label="",style="solid", color="blue", weight=9];
11443 -> 2136[label="",style="solid", color="blue", weight=3];
11444[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11444[label="",style="solid", color="blue", weight=9];
11444 -> 2137[label="",style="solid", color="blue", weight=3];
11445[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11445[label="",style="solid", color="blue", weight=9];
11445 -> 2138[label="",style="solid", color="blue", weight=3];
11446[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11446[label="",style="solid", color="blue", weight=9];
11446 -> 2139[label="",style="solid", color="blue", weight=3];
11447[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11447[label="",style="solid", color="blue", weight=9];
11447 -> 2140[label="",style="solid", color="blue", weight=3];
11448[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11448[label="",style="solid", color="blue", weight=9];
11448 -> 2141[label="",style="solid", color="blue", weight=3];
11449[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];1930 -> 11449[label="",style="solid", color="blue", weight=9];
11449 -> 2142[label="",style="solid", color="blue", weight=3];
1931[label="zx101",fontsize=16,color="green",shape="box"];1928[label="foldr (++) [] (map (range1 zx144 zx145) zx146)",fontsize=16,color="burlywood",shape="triangle"];11450[label="zx146/zx1460 : zx1461",fontsize=10,color="white",style="solid",shape="box"];1928 -> 11450[label="",style="solid", color="burlywood", weight=9];
11450 -> 2143[label="",style="solid", color="burlywood", weight=3];
11451[label="zx146/[]",fontsize=10,color="white",style="solid",shape="box"];1928 -> 11451[label="",style="solid", color="burlywood", weight=9];
11451 -> 2144[label="",style="solid", color="burlywood", weight=3];
2288[label="index5 zx64 zx67 zx67 (not (compare zx64 zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11452[label="zx64/Integer zx640",fontsize=10,color="white",style="solid",shape="box"];2288 -> 11452[label="",style="solid", color="burlywood", weight=9];
11452 -> 2321[label="",style="solid", color="burlywood", weight=3];
2289[label="index12 zx64 zx67 zx67 (not (compare zx64 zx67 == GT) && zx67 <= zx67)",fontsize=16,color="black",shape="triangle"];2289 -> 2322[label="",style="solid", color="black", weight=3];
2290[label="index3 zx67 zx64 (not (compare2 zx67 zx67 (zx67 == zx67) == LT) && zx67 >= zx64)",fontsize=16,color="burlywood",shape="box"];11453[label="zx67/LT",fontsize=10,color="white",style="solid",shape="box"];2290 -> 11453[label="",style="solid", color="burlywood", weight=9];
11453 -> 2323[label="",style="solid", color="burlywood", weight=3];
11454[label="zx67/EQ",fontsize=10,color="white",style="solid",shape="box"];2290 -> 11454[label="",style="solid", color="burlywood", weight=9];
11454 -> 2324[label="",style="solid", color="burlywood", weight=3];
11455[label="zx67/GT",fontsize=10,color="white",style="solid",shape="box"];2290 -> 11455[label="",style="solid", color="burlywood", weight=9];
11455 -> 2325[label="",style="solid", color="burlywood", weight=3];
2291[label="index2 zx67 zx64 (not (compare2 zx67 zx67 (zx67 == zx67) == LT) && zx67 >= zx64)",fontsize=16,color="burlywood",shape="box"];11456[label="zx67/False",fontsize=10,color="white",style="solid",shape="box"];2291 -> 11456[label="",style="solid", color="burlywood", weight=9];
11456 -> 2326[label="",style="solid", color="burlywood", weight=3];
11457[label="zx67/True",fontsize=10,color="white",style="solid",shape="box"];2291 -> 11457[label="",style="solid", color="burlywood", weight=9];
11457 -> 2327[label="",style="solid", color="burlywood", weight=3];
2292[label="primPlusInt (Pos zx151) (Pos (primMulNat zx1520 zx1530))",fontsize=16,color="black",shape="triangle"];2292 -> 2328[label="",style="solid", color="black", weight=3];
2293[label="primPlusInt (Pos zx151) (Neg (primMulNat zx1520 zx1530))",fontsize=16,color="black",shape="triangle"];2293 -> 2329[label="",style="solid", color="black", weight=3];
2294 -> 2293[label="",style="dashed", color="red", weight=0];
2294[label="primPlusInt (Pos zx151) (Neg (primMulNat zx1520 zx1530))",fontsize=16,color="magenta"];2294 -> 2330[label="",style="dashed", color="magenta", weight=3];
2294 -> 2331[label="",style="dashed", color="magenta", weight=3];
2295 -> 2292[label="",style="dashed", color="red", weight=0];
2295[label="primPlusInt (Pos zx151) (Pos (primMulNat zx1520 zx1530))",fontsize=16,color="magenta"];2295 -> 2332[label="",style="dashed", color="magenta", weight=3];
2295 -> 2333[label="",style="dashed", color="magenta", weight=3];
2296[label="primPlusInt (Neg zx158) (Pos (primMulNat zx1590 zx1600))",fontsize=16,color="black",shape="triangle"];2296 -> 2334[label="",style="solid", color="black", weight=3];
2297[label="primPlusInt (Neg zx158) (Neg (primMulNat zx1590 zx1600))",fontsize=16,color="black",shape="triangle"];2297 -> 2335[label="",style="solid", color="black", weight=3];
2298 -> 2297[label="",style="dashed", color="red", weight=0];
2298[label="primPlusInt (Neg zx158) (Neg (primMulNat zx1590 zx1600))",fontsize=16,color="magenta"];2298 -> 2336[label="",style="dashed", color="magenta", weight=3];
2298 -> 2337[label="",style="dashed", color="magenta", weight=3];
2299 -> 2296[label="",style="dashed", color="red", weight=0];
2299[label="primPlusInt (Neg zx158) (Pos (primMulNat zx1590 zx1600))",fontsize=16,color="magenta"];2299 -> 2338[label="",style="dashed", color="magenta", weight=3];
2299 -> 2339[label="",style="dashed", color="magenta", weight=3];
6997[label="takeWhile0 (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];6997 -> 7010[label="",style="solid", color="black", weight=3];
6998[label="takeWhile (flip (<=) (Integer (Pos (Succ zx444)))) (numericEnumFrom $! Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];6998 -> 7011[label="",style="solid", color="black", weight=3];
2019[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];2020[label="Integer (Pos (Succ zx31000))",fontsize=16,color="green",shape="box"];2021[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];2022[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];2023[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];2024[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];1809[label="index5 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (Integer (Pos zx3100)) (Integer (Neg (Succ zx30000)) <= Integer (Pos zx3100) && Integer (Pos zx3100) <= Integer (Pos zx3100))",fontsize=16,color="black",shape="box"];1809 -> 2145[label="",style="solid", color="black", weight=3];
6061[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) (null [])",fontsize=16,color="black",shape="box"];6061 -> 6076[label="",style="solid", color="black", weight=3];
6062[label="rangeSize0 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) otherwise",fontsize=16,color="black",shape="box"];6062 -> 6077[label="",style="solid", color="black", weight=3];
2035[label="Integer (Neg (Succ zx30000))",fontsize=16,color="green",shape="box"];2036[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];2037[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];2038[label="Integer (Pos (Succ zx31000))",fontsize=16,color="green",shape="box"];2039[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];2040[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];2041[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];2042[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];2050 -> 2240[label="",style="dashed", color="red", weight=0];
2050[label="takeWhile (flip (<=) (Pos (Succ zx31000))) (enforceWHNF (WHNF (Pos Zero + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];2050 -> 2254[label="",style="dashed", color="magenta", weight=3];
2050 -> 2255[label="",style="dashed", color="magenta", weight=3];
2050 -> 2256[label="",style="dashed", color="magenta", weight=3];
2243[label="Zero",fontsize=16,color="green",shape="box"];2244[label="Pos Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="black",shape="triangle"];2244 -> 2302[label="",style="solid", color="black", weight=3];
2245 -> 2244[label="",style="dashed", color="red", weight=0];
2245[label="Pos Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2383 -> 2244[label="",style="dashed", color="red", weight=0];
2383[label="Pos Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2384 -> 2244[label="",style="dashed", color="red", weight=0];
2384[label="Pos Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2382[label="takeWhile (flip (<=) (Neg Zero)) (enforceWHNF (WHNF zx173) (numericEnumFrom zx172))",fontsize=16,color="black",shape="triangle"];2382 -> 2399[label="",style="solid", color="black", weight=3];
2301 -> 188[label="",style="dashed", color="red", weight=0];
2301[label="takeWhile (flip (<=) (Pos zx3100)) (numericEnumFrom zx165)",fontsize=16,color="magenta"];2301 -> 2341[label="",style="dashed", color="magenta", weight=3];
2301 -> 2342[label="",style="dashed", color="magenta", weight=3];
2061 -> 2382[label="",style="dashed", color="red", weight=0];
2061[label="takeWhile (flip (<=) (Neg Zero)) (enforceWHNF (WHNF (Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Neg (Succ zx30000) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="magenta"];2061 -> 2389[label="",style="dashed", color="magenta", weight=3];
2061 -> 2390[label="",style="dashed", color="magenta", weight=3];
2248[label="Succ zx31000",fontsize=16,color="green",shape="box"];2249[label="Neg Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="black",shape="triangle"];2249 -> 2400[label="",style="solid", color="black", weight=3];
2250 -> 2249[label="",style="dashed", color="red", weight=0];
2250[label="Neg Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2251[label="Zero",fontsize=16,color="green",shape="box"];2252 -> 2249[label="",style="dashed", color="red", weight=0];
2252[label="Neg Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2253 -> 2249[label="",style="dashed", color="red", weight=0];
2253[label="Neg Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2385 -> 2249[label="",style="dashed", color="red", weight=0];
2385[label="Neg Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2386 -> 2249[label="",style="dashed", color="red", weight=0];
2386[label="Neg Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2427[label="error []",fontsize=16,color="red",shape="box"];2432[label="inRangeI zx31",fontsize=16,color="black",shape="box"];2432 -> 2434[label="",style="solid", color="black", weight=3];
2431[label="index8 zx30 zx31 zx31 (not (primCmpInt zx176 zx129 == GT))",fontsize=16,color="burlywood",shape="triangle"];11473[label="zx176/Pos zx1760",fontsize=10,color="white",style="solid",shape="box"];2431 -> 11473[label="",style="solid", color="burlywood", weight=9];
11473 -> 2435[label="",style="solid", color="burlywood", weight=3];
11474[label="zx176/Neg zx1760",fontsize=10,color="white",style="solid",shape="box"];2431 -> 11474[label="",style="solid", color="burlywood", weight=9];
11474 -> 2436[label="",style="solid", color="burlywood", weight=3];
6891 -> 2240[label="",style="dashed", color="red", weight=0];
6891[label="takeWhile (flip (<=) (Pos (Succ zx429))) (enforceWHNF (WHNF zx431) (numericEnumFrom zx431))",fontsize=16,color="magenta"];6891 -> 7000[label="",style="dashed", color="magenta", weight=3];
6891 -> 7001[label="",style="dashed", color="magenta", weight=3];
6891 -> 7002[label="",style="dashed", color="magenta", weight=3];
1810[label="index12 (Pos Zero) (Pos (Succ zx3100)) (Pos (Succ zx3100)) (Pos Zero <= Pos (Succ zx3100) && Pos (Succ zx3100) <= Pos (Succ zx3100))",fontsize=16,color="black",shape="box"];1810 -> 2146[label="",style="solid", color="black", weight=3];
2077 -> 2180[label="",style="dashed", color="red", weight=0];
2077[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (compare (Pos Zero) (Pos Zero) /= GT && Pos Zero <= Pos Zero)",fontsize=16,color="magenta"];2077 -> 2415[label="",style="dashed", color="magenta", weight=3];
2077 -> 2416[label="",style="dashed", color="magenta", weight=3];
2078 -> 2180[label="",style="dashed", color="red", weight=0];
2078[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (compare (Pos Zero) (Neg Zero) /= GT && Neg Zero <= Neg Zero)",fontsize=16,color="magenta"];2078 -> 2417[label="",style="dashed", color="magenta", weight=3];
2078 -> 2418[label="",style="dashed", color="magenta", weight=3];
2079 -> 2289[label="",style="dashed", color="red", weight=0];
2079[label="index12 (Neg (Succ zx3000)) (Pos zx310) (Pos zx310) (not (compare (Neg (Succ zx3000)) (Pos zx310) == GT) && Pos zx310 <= Pos zx310)",fontsize=16,color="magenta"];2079 -> 2419[label="",style="dashed", color="magenta", weight=3];
2079 -> 2420[label="",style="dashed", color="magenta", weight=3];
6999[label="takeWhile (flip (<=) (Neg (Succ zx435))) (enforceWHNF (WHNF zx437) (numericEnumFrom zx437))",fontsize=16,color="black",shape="box"];6999 -> 7012[label="",style="solid", color="black", weight=3];
2092[label="Neg (Succ zx3000)",fontsize=16,color="green",shape="box"];2093[label="Neg Zero",fontsize=16,color="green",shape="box"];2094 -> 2180[label="",style="dashed", color="red", weight=0];
2094[label="index12 (Neg Zero) (Pos (Succ zx3100)) (Pos (Succ zx3100)) (compare (Neg Zero) (Pos (Succ zx3100)) /= GT && Pos (Succ zx3100) <= Pos (Succ zx3100))",fontsize=16,color="magenta"];2094 -> 2446[label="",style="dashed", color="magenta", weight=3];
2094 -> 2447[label="",style="dashed", color="magenta", weight=3];
2095 -> 2180[label="",style="dashed", color="red", weight=0];
2095[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (compare (Neg Zero) (Pos Zero) /= GT && Pos Zero <= Pos Zero)",fontsize=16,color="magenta"];2095 -> 2448[label="",style="dashed", color="magenta", weight=3];
2095 -> 2449[label="",style="dashed", color="magenta", weight=3];
2096 -> 2180[label="",style="dashed", color="red", weight=0];
2096[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (compare (Neg Zero) (Neg Zero) /= GT && Neg Zero <= Neg Zero)",fontsize=16,color="magenta"];2096 -> 2450[label="",style="dashed", color="magenta", weight=3];
2096 -> 2451[label="",style="dashed", color="magenta", weight=3];
2097[label="rangeSize1 LT LT (null ((++) (LT : []) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2097 -> 2452[label="",style="solid", color="black", weight=3];
2098[label="rangeSize1 EQ LT (null ((++) range40 LT (not True) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2098 -> 2453[label="",style="solid", color="black", weight=3];
2099[label="rangeSize1 GT LT (null ((++) range40 LT (not True) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2099 -> 2454[label="",style="solid", color="black", weight=3];
2100[label="rangeSize1 LT EQ (null ((++) range40 LT (not (compare2 LT LT True == LT)) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2100 -> 2455[label="",style="solid", color="black", weight=3];
2101[label="rangeSize1 EQ EQ (null ((++) range40 LT (not (compare2 LT EQ False == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2101 -> 2456[label="",style="solid", color="black", weight=3];
2102 -> 10650[label="",style="dashed", color="red", weight=0];
2102[label="rangeSize1 GT EQ (null ((++) range40 LT (not (compare2 LT GT False == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))))",fontsize=16,color="magenta"];2102 -> 10651[label="",style="dashed", color="magenta", weight=3];
2103[label="rangeSize1 LT GT (null ((++) range40 LT (not (compare2 LT LT True == LT)) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2103 -> 2458[label="",style="solid", color="black", weight=3];
2104[label="rangeSize1 EQ GT (null ((++) range40 LT (not (compare2 LT EQ False == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2104 -> 2459[label="",style="solid", color="black", weight=3];
2105[label="rangeSize1 GT GT (null ((++) range40 LT (not (compare2 LT GT False == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2105 -> 2460[label="",style="solid", color="black", weight=3];
2106[label="rangeSize1 False False (null ((++) (False : []) foldr (++) [] (map (range0 False False) (True : []))))",fontsize=16,color="black",shape="box"];2106 -> 2461[label="",style="solid", color="black", weight=3];
2107[label="rangeSize1 True False (null ((++) range00 False (not True) foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];2107 -> 2462[label="",style="solid", color="black", weight=3];
2108[label="rangeSize1 False True (null ((++) range00 False (not (compare2 False False True == LT)) foldr (++) [] (map (range0 True False) (True : []))))",fontsize=16,color="black",shape="box"];2108 -> 2463[label="",style="solid", color="black", weight=3];
2109[label="rangeSize1 True True (null ((++) range00 False (not (compare2 False True False == LT)) foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];2109 -> 2464[label="",style="solid", color="black", weight=3];
2114[label="takeWhile1 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];2114 -> 2469[label="",style="solid", color="black", weight=3];
2115[label="takeWhile0 (flip (<=) (Integer (Neg zx31000))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];2115 -> 2470[label="",style="solid", color="black", weight=3];
2116[label="takeWhile1 (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];2116 -> 2471[label="",style="solid", color="black", weight=3];
2117[label="Integer (Pos Zero) : takeWhile (flip (<=) (Integer (Pos Zero))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];2117 -> 2472[label="",style="dashed", color="green", weight=3];
2118[label="takeWhile0 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];2118 -> 2473[label="",style="solid", color="black", weight=3];
2119[label="Integer (Pos Zero) : takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];2119 -> 2474[label="",style="dashed", color="green", weight=3];
2120[label="takeWhile (flip (<=) (Integer (Pos zx31000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2120 -> 2475[label="",style="solid", color="black", weight=3];
7390[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx4890) zx490 == GT))",fontsize=16,color="burlywood",shape="box"];11483[label="zx490/Succ zx4900",fontsize=10,color="white",style="solid",shape="box"];7390 -> 11483[label="",style="solid", color="burlywood", weight=9];
11483 -> 7410[label="",style="solid", color="burlywood", weight=3];
11484[label="zx490/Zero",fontsize=10,color="white",style="solid",shape="box"];7390 -> 11484[label="",style="solid", color="burlywood", weight=9];
11484 -> 7411[label="",style="solid", color="burlywood", weight=3];
7391[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero zx490 == GT))",fontsize=16,color="burlywood",shape="box"];11485[label="zx490/Succ zx4900",fontsize=10,color="white",style="solid",shape="box"];7391 -> 11485[label="",style="solid", color="burlywood", weight=9];
11485 -> 7412[label="",style="solid", color="burlywood", weight=3];
11486[label="zx490/Zero",fontsize=10,color="white",style="solid",shape="box"];7391 -> 11486[label="",style="solid", color="burlywood", weight=9];
11486 -> 7413[label="",style="solid", color="burlywood", weight=3];
2125[label="takeWhile1 (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx300000))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];2125 -> 2480[label="",style="solid", color="black", weight=3];
2126[label="Integer (Neg Zero) : takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];2126 -> 2481[label="",style="dashed", color="green", weight=3];
2127[label="Integer (Neg Zero) : takeWhile (flip (<=) (Integer (Pos Zero))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];2127 -> 2482[label="",style="dashed", color="green", weight=3];
2128[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];2128 -> 2483[label="",style="solid", color="black", weight=3];
2129[label="Integer (Neg Zero) : takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];2129 -> 2484[label="",style="dashed", color="green", weight=3];
2130[label="(++) range40 LT (not (compare3 LT zx300 == LT)) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2130 -> 2485[label="",style="solid", color="black", weight=3];
2131[label="(++) range40 LT (True && LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2131 -> 2486[label="",style="solid", color="black", weight=3];
2132[label="(++) range40 LT (True && LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2132 -> 2487[label="",style="solid", color="black", weight=3];
2133[label="(++) range00 False (not (compare3 False zx300 == LT)) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="black",shape="box"];2133 -> 2488[label="",style="solid", color="black", weight=3];
2134[label="(++) range00 False (True && False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];2134 -> 2489[label="",style="solid", color="black", weight=3];
2319[label="concat (map (range3 zx402 zx412 zx401 zx411) (range (zx400,zx410)))",fontsize=16,color="black",shape="box"];2319 -> 2490[label="",style="solid", color="black", weight=3];
2320[label="concat (map (range6 zx401 zx411) (range (zx400,zx410)))",fontsize=16,color="black",shape="box"];2320 -> 2491[label="",style="solid", color="black", weight=3];
2135 -> 1693[label="",style="dashed", color="red", weight=0];
2135[label="range (zx102,zx103)",fontsize=16,color="magenta"];2135 -> 2492[label="",style="dashed", color="magenta", weight=3];
2135 -> 2493[label="",style="dashed", color="magenta", weight=3];
2136 -> 1694[label="",style="dashed", color="red", weight=0];
2136[label="range (zx102,zx103)",fontsize=16,color="magenta"];2136 -> 2494[label="",style="dashed", color="magenta", weight=3];
2136 -> 2495[label="",style="dashed", color="magenta", weight=3];
2137 -> 106[label="",style="dashed", color="red", weight=0];
2137[label="range (zx102,zx103)",fontsize=16,color="magenta"];2137 -> 2496[label="",style="dashed", color="magenta", weight=3];
2137 -> 2497[label="",style="dashed", color="magenta", weight=3];
2138 -> 107[label="",style="dashed", color="red", weight=0];
2138[label="range (zx102,zx103)",fontsize=16,color="magenta"];2138 -> 2498[label="",style="dashed", color="magenta", weight=3];
2138 -> 2499[label="",style="dashed", color="magenta", weight=3];
2139 -> 108[label="",style="dashed", color="red", weight=0];
2139[label="range (zx102,zx103)",fontsize=16,color="magenta"];2139 -> 2500[label="",style="dashed", color="magenta", weight=3];
2139 -> 2501[label="",style="dashed", color="magenta", weight=3];
2140 -> 109[label="",style="dashed", color="red", weight=0];
2140[label="range (zx102,zx103)",fontsize=16,color="magenta"];2140 -> 2502[label="",style="dashed", color="magenta", weight=3];
2140 -> 2503[label="",style="dashed", color="magenta", weight=3];
2141 -> 110[label="",style="dashed", color="red", weight=0];
2141[label="range (zx102,zx103)",fontsize=16,color="magenta"];2141 -> 2504[label="",style="dashed", color="magenta", weight=3];
2141 -> 2505[label="",style="dashed", color="magenta", weight=3];
2142 -> 111[label="",style="dashed", color="red", weight=0];
2142[label="range (zx102,zx103)",fontsize=16,color="magenta"];2142 -> 2506[label="",style="dashed", color="magenta", weight=3];
2142 -> 2507[label="",style="dashed", color="magenta", weight=3];
2143[label="foldr (++) [] (map (range1 zx144 zx145) (zx1460 : zx1461))",fontsize=16,color="black",shape="box"];2143 -> 2508[label="",style="solid", color="black", weight=3];
2144[label="foldr (++) [] (map (range1 zx144 zx145) [])",fontsize=16,color="black",shape="box"];2144 -> 2509[label="",style="solid", color="black", weight=3];
2321[label="index5 (Integer zx640) zx67 zx67 (not (compare (Integer zx640) zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11495[label="zx67/Integer zx670",fontsize=10,color="white",style="solid",shape="box"];2321 -> 11495[label="",style="solid", color="burlywood", weight=9];
11495 -> 2510[label="",style="solid", color="burlywood", weight=3];
2322[label="index12 zx64 zx67 zx67 (not (primCmpInt zx64 zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11496[label="zx64/Pos zx640",fontsize=10,color="white",style="solid",shape="box"];2322 -> 11496[label="",style="solid", color="burlywood", weight=9];
11496 -> 2511[label="",style="solid", color="burlywood", weight=3];
11497[label="zx64/Neg zx640",fontsize=10,color="white",style="solid",shape="box"];2322 -> 11497[label="",style="solid", color="burlywood", weight=9];
11497 -> 2512[label="",style="solid", color="burlywood", weight=3];
2323[label="index3 LT zx64 (not (compare2 LT LT (LT == LT) == LT) && LT >= zx64)",fontsize=16,color="black",shape="box"];2323 -> 2513[label="",style="solid", color="black", weight=3];
2324[label="index3 EQ zx64 (not (compare2 EQ EQ (EQ == EQ) == LT) && EQ >= zx64)",fontsize=16,color="black",shape="box"];2324 -> 2514[label="",style="solid", color="black", weight=3];
2325[label="index3 GT zx64 (not (compare2 GT GT (GT == GT) == LT) && GT >= zx64)",fontsize=16,color="black",shape="box"];2325 -> 2515[label="",style="solid", color="black", weight=3];
2326[label="index2 False zx64 (not (compare2 False False (False == False) == LT) && False >= zx64)",fontsize=16,color="black",shape="box"];2326 -> 2516[label="",style="solid", color="black", weight=3];
2327[label="index2 True zx64 (not (compare2 True True (True == True) == LT) && True >= zx64)",fontsize=16,color="black",shape="box"];2327 -> 2517[label="",style="solid", color="black", weight=3];
2328[label="Pos (primPlusNat zx151 (primMulNat zx1520 zx1530))",fontsize=16,color="green",shape="box"];2328 -> 2518[label="",style="dashed", color="green", weight=3];
2329[label="primMinusNat zx151 (primMulNat zx1520 zx1530)",fontsize=16,color="burlywood",shape="box"];11498[label="zx151/Succ zx1510",fontsize=10,color="white",style="solid",shape="box"];2329 -> 11498[label="",style="solid", color="burlywood", weight=9];
11498 -> 2519[label="",style="solid", color="burlywood", weight=3];
11499[label="zx151/Zero",fontsize=10,color="white",style="solid",shape="box"];2329 -> 11499[label="",style="solid", color="burlywood", weight=9];
11499 -> 2520[label="",style="solid", color="burlywood", weight=3];
2330[label="zx1530",fontsize=16,color="green",shape="box"];2331[label="zx1520",fontsize=16,color="green",shape="box"];2332[label="zx1520",fontsize=16,color="green",shape="box"];2333[label="zx1530",fontsize=16,color="green",shape="box"];2334[label="primMinusNat (primMulNat zx1590 zx1600) zx158",fontsize=16,color="burlywood",shape="box"];11500[label="zx1590/Succ zx15900",fontsize=10,color="white",style="solid",shape="box"];2334 -> 11500[label="",style="solid", color="burlywood", weight=9];
11500 -> 2521[label="",style="solid", color="burlywood", weight=3];
11501[label="zx1590/Zero",fontsize=10,color="white",style="solid",shape="box"];2334 -> 11501[label="",style="solid", color="burlywood", weight=9];
11501 -> 2522[label="",style="solid", color="burlywood", weight=3];
2335[label="Neg (primPlusNat zx158 (primMulNat zx1590 zx1600))",fontsize=16,color="green",shape="box"];2335 -> 2523[label="",style="dashed", color="green", weight=3];
2336[label="zx1590",fontsize=16,color="green",shape="box"];2337[label="zx1600",fontsize=16,color="green",shape="box"];2338[label="zx1590",fontsize=16,color="green",shape="box"];2339[label="zx1600",fontsize=16,color="green",shape="box"];7010[label="[]",fontsize=16,color="green",shape="box"];7011[label="takeWhile (flip (<=) (Integer (Pos (Succ zx444)))) (Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];7011 -> 7040[label="",style="solid", color="black", weight=3];
2145 -> 2179[label="",style="dashed", color="red", weight=0];
2145[label="index5 (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) (Integer (Pos zx3100)) (compare (Integer (Neg (Succ zx30000))) (Integer (Pos zx3100)) /= GT && Integer (Pos zx3100) <= Integer (Pos zx3100))",fontsize=16,color="magenta"];2145 -> 2536[label="",style="dashed", color="magenta", weight=3];
2145 -> 2537[label="",style="dashed", color="magenta", weight=3];
6076[label="rangeSize1 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) True",fontsize=16,color="black",shape="box"];6076 -> 6096[label="",style="solid", color="black", weight=3];
6077[label="rangeSize0 (Integer (Neg (Succ zx385))) (Integer (Neg (Succ zx386))) True",fontsize=16,color="black",shape="box"];6077 -> 6097[label="",style="solid", color="black", weight=3];
2254[label="Succ zx31000",fontsize=16,color="green",shape="box"];2255 -> 2244[label="",style="dashed", color="red", weight=0];
2255[label="Pos Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2256 -> 2244[label="",style="dashed", color="red", weight=0];
2256[label="Pos Zero + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2302[label="primPlusInt (Pos Zero) (fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2302 -> 2560[label="",style="solid", color="black", weight=3];
2399 -> 188[label="",style="dashed", color="red", weight=0];
2399[label="takeWhile (flip (<=) (Neg Zero)) (numericEnumFrom zx172)",fontsize=16,color="magenta"];2399 -> 2561[label="",style="dashed", color="magenta", weight=3];
2399 -> 2562[label="",style="dashed", color="magenta", weight=3];
2341[label="zx165",fontsize=16,color="green",shape="box"];2342[label="Pos zx3100",fontsize=16,color="green",shape="box"];2389 -> 2241[label="",style="dashed", color="red", weight=0];
2389[label="Neg (Succ zx30000) + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2390 -> 2241[label="",style="dashed", color="red", weight=0];
2390[label="Neg (Succ zx30000) + fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];2400[label="primPlusInt (Neg Zero) (fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2400 -> 2578[label="",style="solid", color="black", weight=3];
2434 -> 220[label="",style="dashed", color="red", weight=0];
2434[label="fromEnum zx31",fontsize=16,color="magenta"];2434 -> 2579[label="",style="dashed", color="magenta", weight=3];
2435[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos zx1760) zx129 == GT))",fontsize=16,color="burlywood",shape="box"];11509[label="zx1760/Succ zx17600",fontsize=10,color="white",style="solid",shape="box"];2435 -> 11509[label="",style="solid", color="burlywood", weight=9];
11509 -> 2580[label="",style="solid", color="burlywood", weight=3];
11510[label="zx1760/Zero",fontsize=10,color="white",style="solid",shape="box"];2435 -> 11510[label="",style="solid", color="burlywood", weight=9];
11510 -> 2581[label="",style="solid", color="burlywood", weight=3];
2436[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg zx1760) zx129 == GT))",fontsize=16,color="burlywood",shape="box"];11511[label="zx1760/Succ zx17600",fontsize=10,color="white",style="solid",shape="box"];2436 -> 11511[label="",style="solid", color="burlywood", weight=9];
11511 -> 2582[label="",style="solid", color="burlywood", weight=3];
11512[label="zx1760/Zero",fontsize=10,color="white",style="solid",shape="box"];2436 -> 11512[label="",style="solid", color="burlywood", weight=9];
11512 -> 2583[label="",style="solid", color="burlywood", weight=3];
7000[label="Succ zx429",fontsize=16,color="green",shape="box"];7001[label="zx431",fontsize=16,color="green",shape="box"];7002[label="zx431",fontsize=16,color="green",shape="box"];2146 -> 2180[label="",style="dashed", color="red", weight=0];
2146[label="index12 (Pos Zero) (Pos (Succ zx3100)) (Pos (Succ zx3100)) (compare (Pos Zero) (Pos (Succ zx3100)) /= GT && Pos (Succ zx3100) <= Pos (Succ zx3100))",fontsize=16,color="magenta"];2146 -> 2595[label="",style="dashed", color="magenta", weight=3];
2146 -> 2596[label="",style="dashed", color="magenta", weight=3];
2415[label="Pos Zero",fontsize=16,color="green",shape="box"];2416[label="Pos Zero",fontsize=16,color="green",shape="box"];2417[label="Pos Zero",fontsize=16,color="green",shape="box"];2418[label="Neg Zero",fontsize=16,color="green",shape="box"];2419[label="Neg (Succ zx3000)",fontsize=16,color="green",shape="box"];2420[label="Pos zx310",fontsize=16,color="green",shape="box"];7012 -> 188[label="",style="dashed", color="red", weight=0];
7012[label="takeWhile (flip (<=) (Neg (Succ zx435))) (numericEnumFrom zx437)",fontsize=16,color="magenta"];7012 -> 7041[label="",style="dashed", color="magenta", weight=3];
7012 -> 7042[label="",style="dashed", color="magenta", weight=3];
2446[label="Neg Zero",fontsize=16,color="green",shape="box"];2447[label="Pos (Succ zx3100)",fontsize=16,color="green",shape="box"];2448[label="Neg Zero",fontsize=16,color="green",shape="box"];2449[label="Pos Zero",fontsize=16,color="green",shape="box"];2450[label="Neg Zero",fontsize=16,color="green",shape="box"];2451[label="Neg Zero",fontsize=16,color="green",shape="box"];2452[label="rangeSize1 LT LT (null (LT : [] ++ foldr (++) [] (map (range4 LT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2452 -> 2614[label="",style="solid", color="black", weight=3];
2453[label="rangeSize1 EQ LT (null ((++) range40 LT False foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2453 -> 2615[label="",style="solid", color="black", weight=3];
2454[label="rangeSize1 GT LT (null ((++) range40 LT False foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2454 -> 2616[label="",style="solid", color="black", weight=3];
2455[label="rangeSize1 LT EQ (null ((++) range40 LT (not (EQ == LT)) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2455 -> 2617[label="",style="solid", color="black", weight=3];
2456[label="rangeSize1 EQ EQ (null ((++) range40 LT (not (compare1 LT EQ (LT <= EQ) == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2456 -> 2618[label="",style="solid", color="black", weight=3];
10651 -> 3641[label="",style="dashed", color="red", weight=0];
10651[label="(++) range40 LT (not (compare2 LT GT False == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="magenta"];10650[label="rangeSize1 GT EQ (null zx711)",fontsize=16,color="burlywood",shape="triangle"];11516[label="zx711/zx7110 : zx7111",fontsize=10,color="white",style="solid",shape="box"];10650 -> 11516[label="",style="solid", color="burlywood", weight=9];
11516 -> 10700[label="",style="solid", color="burlywood", weight=3];
11517[label="zx711/[]",fontsize=10,color="white",style="solid",shape="box"];10650 -> 11517[label="",style="solid", color="burlywood", weight=9];
11517 -> 10701[label="",style="solid", color="burlywood", weight=3];
2458[label="rangeSize1 LT GT (null ((++) range40 LT (not (EQ == LT)) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2458 -> 2620[label="",style="solid", color="black", weight=3];
2459[label="rangeSize1 EQ GT (null ((++) range40 LT (not (compare1 LT EQ (LT <= EQ) == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2459 -> 2621[label="",style="solid", color="black", weight=3];
2460[label="rangeSize1 GT GT (null ((++) range40 LT (not (compare1 LT GT (LT <= GT) == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2460 -> 2622[label="",style="solid", color="black", weight=3];
2461[label="rangeSize1 False False (null (False : [] ++ foldr (++) [] (map (range0 False False) (True : []))))",fontsize=16,color="black",shape="box"];2461 -> 2623[label="",style="solid", color="black", weight=3];
2462[label="rangeSize1 True False (null ((++) range00 False False foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];2462 -> 2624[label="",style="solid", color="black", weight=3];
2463[label="rangeSize1 False True (null ((++) range00 False (not (EQ == LT)) foldr (++) [] (map (range0 True False) (True : []))))",fontsize=16,color="black",shape="box"];2463 -> 2625[label="",style="solid", color="black", weight=3];
2464[label="rangeSize1 True True (null ((++) range00 False (not (compare1 False True (False <= True) == LT)) foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];2464 -> 2626[label="",style="solid", color="black", weight=3];
2469[label="takeWhile0 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];2469 -> 2632[label="",style="solid", color="black", weight=3];
2470[label="[]",fontsize=16,color="green",shape="box"];2471[label="Integer (Pos Zero) : takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];2471 -> 2633[label="",style="dashed", color="green", weight=3];
2472[label="takeWhile (flip (<=) (Integer (Pos Zero))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2472 -> 2634[label="",style="solid", color="black", weight=3];
2473[label="takeWhile0 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Pos Zero)) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];2473 -> 2635[label="",style="solid", color="black", weight=3];
2474[label="takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2474 -> 2636[label="",style="solid", color="black", weight=3];
2475[label="takeWhile (flip (<=) (Integer (Pos zx31000))) (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2475 -> 2637[label="",style="solid", color="black", weight=3];
7410[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx4890) (Succ zx4900) == GT))",fontsize=16,color="black",shape="box"];7410 -> 7417[label="",style="solid", color="black", weight=3];
7411[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat (Succ zx4890) Zero == GT))",fontsize=16,color="black",shape="box"];7411 -> 7418[label="",style="solid", color="black", weight=3];
7412[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero (Succ zx4900) == GT))",fontsize=16,color="black",shape="box"];7412 -> 7419[label="",style="solid", color="black", weight=3];
7413[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];7413 -> 7420[label="",style="solid", color="black", weight=3];
2480[label="Integer (Neg (Succ zx300000)) : takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];2480 -> 2643[label="",style="dashed", color="green", weight=3];
2481[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2481 -> 2644[label="",style="solid", color="black", weight=3];
2482[label="takeWhile (flip (<=) (Integer (Pos Zero))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2482 -> 2645[label="",style="solid", color="black", weight=3];
2483[label="takeWhile0 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];2483 -> 2646[label="",style="solid", color="black", weight=3];
2484[label="takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2484 -> 2647[label="",style="solid", color="black", weight=3];
2485[label="(++) range40 LT (not (compare2 LT zx300 (LT == zx300) == LT)) foldr (++) [] (map (range4 LT zx300) (EQ : GT : []))",fontsize=16,color="burlywood",shape="box"];11518[label="zx300/LT",fontsize=10,color="white",style="solid",shape="box"];2485 -> 11518[label="",style="solid", color="burlywood", weight=9];
11518 -> 2648[label="",style="solid", color="burlywood", weight=3];
11519[label="zx300/EQ",fontsize=10,color="white",style="solid",shape="box"];2485 -> 11519[label="",style="solid", color="burlywood", weight=9];
11519 -> 2649[label="",style="solid", color="burlywood", weight=3];
11520[label="zx300/GT",fontsize=10,color="white",style="solid",shape="box"];2485 -> 11520[label="",style="solid", color="burlywood", weight=9];
11520 -> 2650[label="",style="solid", color="burlywood", weight=3];
2486[label="(++) range40 LT (LT >= zx300) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2486 -> 2651[label="",style="solid", color="black", weight=3];
2487[label="(++) range40 LT (LT >= zx300) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2487 -> 2652[label="",style="solid", color="black", weight=3];
2488[label="(++) range00 False (not (compare2 False zx300 (False == zx300) == LT)) foldr (++) [] (map (range0 False zx300) (True : []))",fontsize=16,color="burlywood",shape="box"];11521[label="zx300/False",fontsize=10,color="white",style="solid",shape="box"];2488 -> 11521[label="",style="solid", color="burlywood", weight=9];
11521 -> 2653[label="",style="solid", color="burlywood", weight=3];
11522[label="zx300/True",fontsize=10,color="white",style="solid",shape="box"];2488 -> 11522[label="",style="solid", color="burlywood", weight=9];
11522 -> 2654[label="",style="solid", color="burlywood", weight=3];
2489[label="(++) range00 False (False >= zx300) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];2489 -> 2655[label="",style="solid", color="black", weight=3];
2490 -> 306[label="",style="dashed", color="red", weight=0];
2490[label="foldr (++) [] (map (range3 zx402 zx412 zx401 zx411) (range (zx400,zx410)))",fontsize=16,color="magenta"];2490 -> 2656[label="",style="dashed", color="magenta", weight=3];
2490 -> 2657[label="",style="dashed", color="magenta", weight=3];
2490 -> 2658[label="",style="dashed", color="magenta", weight=3];
2490 -> 2659[label="",style="dashed", color="magenta", weight=3];
2490 -> 2660[label="",style="dashed", color="magenta", weight=3];
2491 -> 317[label="",style="dashed", color="red", weight=0];
2491[label="foldr (++) [] (map (range6 zx401 zx411) (range (zx400,zx410)))",fontsize=16,color="magenta"];2491 -> 2661[label="",style="dashed", color="magenta", weight=3];
2491 -> 2662[label="",style="dashed", color="magenta", weight=3];
2491 -> 2663[label="",style="dashed", color="magenta", weight=3];
2492[label="zx103",fontsize=16,color="green",shape="box"];2493[label="zx102",fontsize=16,color="green",shape="box"];2494[label="zx103",fontsize=16,color="green",shape="box"];2495[label="zx102",fontsize=16,color="green",shape="box"];2496[label="zx102",fontsize=16,color="green",shape="box"];2497[label="zx103",fontsize=16,color="green",shape="box"];2498[label="zx102",fontsize=16,color="green",shape="box"];2499[label="zx103",fontsize=16,color="green",shape="box"];2500[label="zx102",fontsize=16,color="green",shape="box"];2501[label="zx103",fontsize=16,color="green",shape="box"];2502[label="zx102",fontsize=16,color="green",shape="box"];2503[label="zx103",fontsize=16,color="green",shape="box"];2504[label="zx102",fontsize=16,color="green",shape="box"];2505[label="zx103",fontsize=16,color="green",shape="box"];2506[label="zx102",fontsize=16,color="green",shape="box"];2507[label="zx103",fontsize=16,color="green",shape="box"];2508[label="foldr (++) [] (range1 zx144 zx145 zx1460 : map (range1 zx144 zx145) zx1461)",fontsize=16,color="black",shape="box"];2508 -> 2664[label="",style="solid", color="black", weight=3];
2509 -> 452[label="",style="dashed", color="red", weight=0];
2509[label="foldr (++) [] []",fontsize=16,color="magenta"];2510[label="index5 (Integer zx640) (Integer zx670) (Integer zx670) (not (compare (Integer zx640) (Integer zx670) == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="black",shape="box"];2510 -> 2665[label="",style="solid", color="black", weight=3];
2511[label="index12 (Pos zx640) zx67 zx67 (not (primCmpInt (Pos zx640) zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11526[label="zx640/Succ zx6400",fontsize=10,color="white",style="solid",shape="box"];2511 -> 11526[label="",style="solid", color="burlywood", weight=9];
11526 -> 2666[label="",style="solid", color="burlywood", weight=3];
11527[label="zx640/Zero",fontsize=10,color="white",style="solid",shape="box"];2511 -> 11527[label="",style="solid", color="burlywood", weight=9];
11527 -> 2667[label="",style="solid", color="burlywood", weight=3];
2512[label="index12 (Neg zx640) zx67 zx67 (not (primCmpInt (Neg zx640) zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11528[label="zx640/Succ zx6400",fontsize=10,color="white",style="solid",shape="box"];2512 -> 11528[label="",style="solid", color="burlywood", weight=9];
11528 -> 2668[label="",style="solid", color="burlywood", weight=3];
11529[label="zx640/Zero",fontsize=10,color="white",style="solid",shape="box"];2512 -> 11529[label="",style="solid", color="burlywood", weight=9];
11529 -> 2669[label="",style="solid", color="burlywood", weight=3];
2513[label="index3 LT zx64 (not (compare2 LT LT True == LT) && LT >= zx64)",fontsize=16,color="black",shape="box"];2513 -> 2670[label="",style="solid", color="black", weight=3];
2514[label="index3 EQ zx64 (not (compare2 EQ EQ True == LT) && EQ >= zx64)",fontsize=16,color="black",shape="box"];2514 -> 2671[label="",style="solid", color="black", weight=3];
2515[label="index3 GT zx64 (not (compare2 GT GT True == LT) && GT >= zx64)",fontsize=16,color="black",shape="box"];2515 -> 2672[label="",style="solid", color="black", weight=3];
2516[label="index2 False zx64 (not (compare2 False False True == LT) && False >= zx64)",fontsize=16,color="black",shape="box"];2516 -> 2673[label="",style="solid", color="black", weight=3];
2517[label="index2 True zx64 (not (compare2 True True True == LT) && True >= zx64)",fontsize=16,color="black",shape="box"];2517 -> 2674[label="",style="solid", color="black", weight=3];
2518[label="primPlusNat zx151 (primMulNat zx1520 zx1530)",fontsize=16,color="burlywood",shape="triangle"];11530[label="zx151/Succ zx1510",fontsize=10,color="white",style="solid",shape="box"];2518 -> 11530[label="",style="solid", color="burlywood", weight=9];
11530 -> 2675[label="",style="solid", color="burlywood", weight=3];
11531[label="zx151/Zero",fontsize=10,color="white",style="solid",shape="box"];2518 -> 11531[label="",style="solid", color="burlywood", weight=9];
11531 -> 2676[label="",style="solid", color="burlywood", weight=3];
2519[label="primMinusNat (Succ zx1510) (primMulNat zx1520 zx1530)",fontsize=16,color="burlywood",shape="box"];11532[label="zx1520/Succ zx15200",fontsize=10,color="white",style="solid",shape="box"];2519 -> 11532[label="",style="solid", color="burlywood", weight=9];
11532 -> 2677[label="",style="solid", color="burlywood", weight=3];
11533[label="zx1520/Zero",fontsize=10,color="white",style="solid",shape="box"];2519 -> 11533[label="",style="solid", color="burlywood", weight=9];
11533 -> 2678[label="",style="solid", color="burlywood", weight=3];
2520[label="primMinusNat Zero (primMulNat zx1520 zx1530)",fontsize=16,color="burlywood",shape="box"];11534[label="zx1520/Succ zx15200",fontsize=10,color="white",style="solid",shape="box"];2520 -> 11534[label="",style="solid", color="burlywood", weight=9];
11534 -> 2679[label="",style="solid", color="burlywood", weight=3];
11535[label="zx1520/Zero",fontsize=10,color="white",style="solid",shape="box"];2520 -> 11535[label="",style="solid", color="burlywood", weight=9];
11535 -> 2680[label="",style="solid", color="burlywood", weight=3];
2521[label="primMinusNat (primMulNat (Succ zx15900) zx1600) zx158",fontsize=16,color="burlywood",shape="box"];11536[label="zx1600/Succ zx16000",fontsize=10,color="white",style="solid",shape="box"];2521 -> 11536[label="",style="solid", color="burlywood", weight=9];
11536 -> 2681[label="",style="solid", color="burlywood", weight=3];
11537[label="zx1600/Zero",fontsize=10,color="white",style="solid",shape="box"];2521 -> 11537[label="",style="solid", color="burlywood", weight=9];
11537 -> 2682[label="",style="solid", color="burlywood", weight=3];
2522[label="primMinusNat (primMulNat Zero zx1600) zx158",fontsize=16,color="burlywood",shape="box"];11538[label="zx1600/Succ zx16000",fontsize=10,color="white",style="solid",shape="box"];2522 -> 11538[label="",style="solid", color="burlywood", weight=9];
11538 -> 2683[label="",style="solid", color="burlywood", weight=3];
11539[label="zx1600/Zero",fontsize=10,color="white",style="solid",shape="box"];2522 -> 11539[label="",style="solid", color="burlywood", weight=9];
11539 -> 2684[label="",style="solid", color="burlywood", weight=3];
2523 -> 2518[label="",style="dashed", color="red", weight=0];
2523[label="primPlusNat zx158 (primMulNat zx1590 zx1600)",fontsize=16,color="magenta"];2523 -> 2685[label="",style="dashed", color="magenta", weight=3];
2523 -> 2686[label="",style="dashed", color="magenta", weight=3];
2523 -> 2687[label="",style="dashed", color="magenta", weight=3];
7040[label="takeWhile (flip (<=) (Integer (Pos (Succ zx444)))) (enforceWHNF (WHNF (Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos (Succ zx445)) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];7040 -> 7056[label="",style="solid", color="black", weight=3];
2536[label="Integer (Neg (Succ zx30000))",fontsize=16,color="green",shape="box"];2537[label="Integer (Pos zx3100)",fontsize=16,color="green",shape="box"];6096[label="Pos Zero",fontsize=16,color="green",shape="box"];6097 -> 1381[label="",style="dashed", color="red", weight=0];
6097[label="index (Integer (Neg (Succ zx385)),Integer (Neg (Succ zx386))) (Integer (Neg (Succ zx386))) + Pos (Succ Zero)",fontsize=16,color="magenta"];6097 -> 6104[label="",style="dashed", color="magenta", weight=3];
2560 -> 1395[label="",style="dashed", color="red", weight=0];
2560[label="primPlusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];2560 -> 2725[label="",style="dashed", color="magenta", weight=3];
2561[label="zx172",fontsize=16,color="green",shape="box"];2562[label="Neg Zero",fontsize=16,color="green",shape="box"];2578 -> 1395[label="",style="dashed", color="red", weight=0];
2578[label="primPlusInt (Neg Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];2578 -> 2737[label="",style="dashed", color="magenta", weight=3];
2579[label="zx31",fontsize=16,color="green",shape="box"];2580[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx17600)) zx129 == GT))",fontsize=16,color="burlywood",shape="box"];11544[label="zx129/Pos zx1290",fontsize=10,color="white",style="solid",shape="box"];2580 -> 11544[label="",style="solid", color="burlywood", weight=9];
11544 -> 2738[label="",style="solid", color="burlywood", weight=3];
11545[label="zx129/Neg zx1290",fontsize=10,color="white",style="solid",shape="box"];2580 -> 11545[label="",style="solid", color="burlywood", weight=9];
11545 -> 2739[label="",style="solid", color="burlywood", weight=3];
2581[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) zx129 == GT))",fontsize=16,color="burlywood",shape="box"];11546[label="zx129/Pos zx1290",fontsize=10,color="white",style="solid",shape="box"];2581 -> 11546[label="",style="solid", color="burlywood", weight=9];
11546 -> 2740[label="",style="solid", color="burlywood", weight=3];
11547[label="zx129/Neg zx1290",fontsize=10,color="white",style="solid",shape="box"];2581 -> 11547[label="",style="solid", color="burlywood", weight=9];
11547 -> 2741[label="",style="solid", color="burlywood", weight=3];
2582[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx17600)) zx129 == GT))",fontsize=16,color="burlywood",shape="box"];11548[label="zx129/Pos zx1290",fontsize=10,color="white",style="solid",shape="box"];2582 -> 11548[label="",style="solid", color="burlywood", weight=9];
11548 -> 2742[label="",style="solid", color="burlywood", weight=3];
11549[label="zx129/Neg zx1290",fontsize=10,color="white",style="solid",shape="box"];2582 -> 11549[label="",style="solid", color="burlywood", weight=9];
11549 -> 2743[label="",style="solid", color="burlywood", weight=3];
2583[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) zx129 == GT))",fontsize=16,color="burlywood",shape="box"];11550[label="zx129/Pos zx1290",fontsize=10,color="white",style="solid",shape="box"];2583 -> 11550[label="",style="solid", color="burlywood", weight=9];
11550 -> 2744[label="",style="solid", color="burlywood", weight=3];
11551[label="zx129/Neg zx1290",fontsize=10,color="white",style="solid",shape="box"];2583 -> 11551[label="",style="solid", color="burlywood", weight=9];
11551 -> 2745[label="",style="solid", color="burlywood", weight=3];
2595[label="Pos Zero",fontsize=16,color="green",shape="box"];2596[label="Pos (Succ zx3100)",fontsize=16,color="green",shape="box"];7041[label="zx437",fontsize=16,color="green",shape="box"];7042[label="Neg (Succ zx435)",fontsize=16,color="green",shape="box"];2614[label="rangeSize1 LT LT False",fontsize=16,color="black",shape="box"];2614 -> 2772[label="",style="solid", color="black", weight=3];
2615[label="rangeSize1 EQ LT (null ((++) [] foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2615 -> 2773[label="",style="solid", color="black", weight=3];
2616[label="rangeSize1 GT LT (null ((++) [] foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2616 -> 2774[label="",style="solid", color="black", weight=3];
2617[label="rangeSize1 LT EQ (null ((++) range40 LT (not False) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2617 -> 2775[label="",style="solid", color="black", weight=3];
2618[label="rangeSize1 EQ EQ (null ((++) range40 LT (not (compare1 LT EQ True == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2618 -> 2776[label="",style="solid", color="black", weight=3];
3641[label="(++) range40 LT (not (compare2 LT GT False == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="triangle"];3641 -> 3835[label="",style="solid", color="black", weight=3];
10700[label="rangeSize1 GT EQ (null (zx7110 : zx7111))",fontsize=16,color="black",shape="box"];10700 -> 10709[label="",style="solid", color="black", weight=3];
10701[label="rangeSize1 GT EQ (null [])",fontsize=16,color="black",shape="box"];10701 -> 10710[label="",style="solid", color="black", weight=3];
2620[label="rangeSize1 LT GT (null ((++) range40 LT (not False) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2620 -> 2778[label="",style="solid", color="black", weight=3];
2621[label="rangeSize1 EQ GT (null ((++) range40 LT (not (compare1 LT EQ True == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2621 -> 2779[label="",style="solid", color="black", weight=3];
2622[label="rangeSize1 GT GT (null ((++) range40 LT (not (compare1 LT GT True == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2622 -> 2780[label="",style="solid", color="black", weight=3];
2623[label="rangeSize1 False False False",fontsize=16,color="black",shape="box"];2623 -> 2781[label="",style="solid", color="black", weight=3];
2624[label="rangeSize1 True False (null ((++) [] foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];2624 -> 2782[label="",style="solid", color="black", weight=3];
2625[label="rangeSize1 False True (null ((++) range00 False (not False) foldr (++) [] (map (range0 True False) (True : []))))",fontsize=16,color="black",shape="box"];2625 -> 2783[label="",style="solid", color="black", weight=3];
2626[label="rangeSize1 True True (null ((++) range00 False (not (compare1 False True True == LT)) foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];2626 -> 2784[label="",style="solid", color="black", weight=3];
2632[label="takeWhile0 (flip (<=) (Integer (Pos Zero))) (Integer (Pos (Succ zx300000))) (numericEnumFrom $! Integer (Pos (Succ zx300000)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];2632 -> 2792[label="",style="solid", color="black", weight=3];
2633[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (numericEnumFrom $! Integer (Pos Zero) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2633 -> 2793[label="",style="solid", color="black", weight=3];
2634[label="takeWhile (flip (<=) (Integer (Pos Zero))) (Integer (Pos Zero) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Pos Zero) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2634 -> 2794[label="",style="solid", color="black", weight=3];
2635[label="[]",fontsize=16,color="green",shape="box"];2636[label="takeWhile (flip (<=) (Integer (Neg Zero))) (Integer (Pos Zero) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Pos Zero) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2636 -> 2795[label="",style="solid", color="black", weight=3];
2637[label="takeWhile (flip (<=) (Integer (Pos zx31000))) (enforceWHNF (WHNF (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2637 -> 2796[label="",style="solid", color="black", weight=3];
7417 -> 7349[label="",style="dashed", color="red", weight=0];
7417[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (primCmpNat zx4890 zx4900 == GT))",fontsize=16,color="magenta"];7417 -> 7450[label="",style="dashed", color="magenta", weight=3];
7417 -> 7451[label="",style="dashed", color="magenta", weight=3];
7418[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];7418 -> 7452[label="",style="solid", color="black", weight=3];
7419[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];7419 -> 7453[label="",style="solid", color="black", weight=3];
7420[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];7420 -> 7454[label="",style="solid", color="black", weight=3];
2643[label="takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom $! Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2643 -> 2804[label="",style="solid", color="black", weight=3];
2644[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Neg Zero) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Neg Zero) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2644 -> 2805[label="",style="solid", color="black", weight=3];
2645[label="takeWhile (flip (<=) (Integer (Pos Zero))) (Integer (Neg Zero) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Neg Zero) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2645 -> 2806[label="",style="solid", color="black", weight=3];
2646[label="takeWhile0 (flip (<=) (Integer (Neg (Succ zx310000)))) (Integer (Neg Zero)) (numericEnumFrom $! Integer (Neg Zero) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];2646 -> 2807[label="",style="solid", color="black", weight=3];
2647[label="takeWhile (flip (<=) (Integer (Neg Zero))) (Integer (Neg Zero) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Neg Zero) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2647 -> 2808[label="",style="solid", color="black", weight=3];
2648[label="(++) range40 LT (not (compare2 LT LT (LT == LT) == LT)) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2648 -> 2809[label="",style="solid", color="black", weight=3];
2649[label="(++) range40 LT (not (compare2 LT EQ (LT == EQ) == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2649 -> 2810[label="",style="solid", color="black", weight=3];
2650[label="(++) range40 LT (not (compare2 LT GT (LT == GT) == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2650 -> 2811[label="",style="solid", color="black", weight=3];
2651[label="(++) range40 LT (compare LT zx300 /= LT) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2651 -> 2812[label="",style="solid", color="black", weight=3];
2652[label="(++) range40 LT (compare LT zx300 /= LT) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2652 -> 2813[label="",style="solid", color="black", weight=3];
2653[label="(++) range00 False (not (compare2 False False (False == False) == LT)) foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];2653 -> 2814[label="",style="solid", color="black", weight=3];
2654[label="(++) range00 False (not (compare2 False True (False == True) == LT)) foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];2654 -> 2815[label="",style="solid", color="black", weight=3];
2655[label="(++) range00 False (compare False zx300 /= LT) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];2655 -> 2816[label="",style="solid", color="black", weight=3];
2656[label="range (zx400,zx410)",fontsize=16,color="blue",shape="box"];11553[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11553[label="",style="solid", color="blue", weight=9];
11553 -> 2817[label="",style="solid", color="blue", weight=3];
11554[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11554[label="",style="solid", color="blue", weight=9];
11554 -> 2818[label="",style="solid", color="blue", weight=3];
11555[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11555[label="",style="solid", color="blue", weight=9];
11555 -> 2819[label="",style="solid", color="blue", weight=3];
11556[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11556[label="",style="solid", color="blue", weight=9];
11556 -> 2820[label="",style="solid", color="blue", weight=3];
11557[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11557[label="",style="solid", color="blue", weight=9];
11557 -> 2821[label="",style="solid", color="blue", weight=3];
11558[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11558[label="",style="solid", color="blue", weight=9];
11558 -> 2822[label="",style="solid", color="blue", weight=3];
11559[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11559[label="",style="solid", color="blue", weight=9];
11559 -> 2823[label="",style="solid", color="blue", weight=3];
11560[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];2656 -> 11560[label="",style="solid", color="blue", weight=9];
11560 -> 2824[label="",style="solid", color="blue", weight=3];
2657[label="zx411",fontsize=16,color="green",shape="box"];2658[label="zx412",fontsize=16,color="green",shape="box"];2659[label="zx402",fontsize=16,color="green",shape="box"];2660[label="zx401",fontsize=16,color="green",shape="box"];2661[label="range (zx400,zx410)",fontsize=16,color="blue",shape="box"];11561[label="range :: ((@2) ((@3) a b c) ((@3) a b c)) -> [] ((@3) a b c)",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11561[label="",style="solid", color="blue", weight=9];
11561 -> 2825[label="",style="solid", color="blue", weight=3];
11562[label="range :: ((@2) ((@2) a b) ((@2) a b)) -> [] ((@2) a b)",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11562[label="",style="solid", color="blue", weight=9];
11562 -> 2826[label="",style="solid", color="blue", weight=3];
11563[label="range :: ((@2) Integer Integer) -> [] Integer",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11563[label="",style="solid", color="blue", weight=9];
11563 -> 2827[label="",style="solid", color="blue", weight=3];
11564[label="range :: ((@2) () ()) -> [] ()",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11564[label="",style="solid", color="blue", weight=9];
11564 -> 2828[label="",style="solid", color="blue", weight=3];
11565[label="range :: ((@2) Char Char) -> [] Char",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11565[label="",style="solid", color="blue", weight=9];
11565 -> 2829[label="",style="solid", color="blue", weight=3];
11566[label="range :: ((@2) Int Int) -> [] Int",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11566[label="",style="solid", color="blue", weight=9];
11566 -> 2830[label="",style="solid", color="blue", weight=3];
11567[label="range :: ((@2) Ordering Ordering) -> [] Ordering",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11567[label="",style="solid", color="blue", weight=9];
11567 -> 2831[label="",style="solid", color="blue", weight=3];
11568[label="range :: ((@2) Bool Bool) -> [] Bool",fontsize=10,color="white",style="solid",shape="box"];2661 -> 11568[label="",style="solid", color="blue", weight=9];
11568 -> 2832[label="",style="solid", color="blue", weight=3];
2662[label="zx411",fontsize=16,color="green",shape="box"];2663[label="zx401",fontsize=16,color="green",shape="box"];2664 -> 1115[label="",style="dashed", color="red", weight=0];
2664[label="(++) range1 zx144 zx145 zx1460 foldr (++) [] (map (range1 zx144 zx145) zx1461)",fontsize=16,color="magenta"];2664 -> 2833[label="",style="dashed", color="magenta", weight=3];
2664 -> 2834[label="",style="dashed", color="magenta", weight=3];
2665[label="index5 (Integer zx640) (Integer zx670) (Integer zx670) (not (primCmpInt zx640 zx670 == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="burlywood",shape="box"];11570[label="zx640/Pos zx6400",fontsize=10,color="white",style="solid",shape="box"];2665 -> 11570[label="",style="solid", color="burlywood", weight=9];
11570 -> 2835[label="",style="solid", color="burlywood", weight=3];
11571[label="zx640/Neg zx6400",fontsize=10,color="white",style="solid",shape="box"];2665 -> 11571[label="",style="solid", color="burlywood", weight=9];
11571 -> 2836[label="",style="solid", color="burlywood", weight=3];
2666[label="index12 (Pos (Succ zx6400)) zx67 zx67 (not (primCmpInt (Pos (Succ zx6400)) zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11572[label="zx67/Pos zx670",fontsize=10,color="white",style="solid",shape="box"];2666 -> 11572[label="",style="solid", color="burlywood", weight=9];
11572 -> 2837[label="",style="solid", color="burlywood", weight=3];
11573[label="zx67/Neg zx670",fontsize=10,color="white",style="solid",shape="box"];2666 -> 11573[label="",style="solid", color="burlywood", weight=9];
11573 -> 2838[label="",style="solid", color="burlywood", weight=3];
2667[label="index12 (Pos Zero) zx67 zx67 (not (primCmpInt (Pos Zero) zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11574[label="zx67/Pos zx670",fontsize=10,color="white",style="solid",shape="box"];2667 -> 11574[label="",style="solid", color="burlywood", weight=9];
11574 -> 2839[label="",style="solid", color="burlywood", weight=3];
11575[label="zx67/Neg zx670",fontsize=10,color="white",style="solid",shape="box"];2667 -> 11575[label="",style="solid", color="burlywood", weight=9];
11575 -> 2840[label="",style="solid", color="burlywood", weight=3];
2668[label="index12 (Neg (Succ zx6400)) zx67 zx67 (not (primCmpInt (Neg (Succ zx6400)) zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11576[label="zx67/Pos zx670",fontsize=10,color="white",style="solid",shape="box"];2668 -> 11576[label="",style="solid", color="burlywood", weight=9];
11576 -> 2841[label="",style="solid", color="burlywood", weight=3];
11577[label="zx67/Neg zx670",fontsize=10,color="white",style="solid",shape="box"];2668 -> 11577[label="",style="solid", color="burlywood", weight=9];
11577 -> 2842[label="",style="solid", color="burlywood", weight=3];
2669[label="index12 (Neg Zero) zx67 zx67 (not (primCmpInt (Neg Zero) zx67 == GT) && zx67 <= zx67)",fontsize=16,color="burlywood",shape="box"];11578[label="zx67/Pos zx670",fontsize=10,color="white",style="solid",shape="box"];2669 -> 11578[label="",style="solid", color="burlywood", weight=9];
11578 -> 2843[label="",style="solid", color="burlywood", weight=3];
11579[label="zx67/Neg zx670",fontsize=10,color="white",style="solid",shape="box"];2669 -> 11579[label="",style="solid", color="burlywood", weight=9];
11579 -> 2844[label="",style="solid", color="burlywood", weight=3];
2670[label="index3 LT zx64 (not (EQ == LT) && LT >= zx64)",fontsize=16,color="black",shape="box"];2670 -> 2845[label="",style="solid", color="black", weight=3];
2671[label="index3 EQ zx64 (not (EQ == LT) && EQ >= zx64)",fontsize=16,color="black",shape="box"];2671 -> 2846[label="",style="solid", color="black", weight=3];
2672[label="index3 GT zx64 (not (EQ == LT) && GT >= zx64)",fontsize=16,color="black",shape="box"];2672 -> 2847[label="",style="solid", color="black", weight=3];
2673[label="index2 False zx64 (not (EQ == LT) && False >= zx64)",fontsize=16,color="black",shape="box"];2673 -> 2848[label="",style="solid", color="black", weight=3];
2674[label="index2 True zx64 (not (EQ == LT) && True >= zx64)",fontsize=16,color="black",shape="box"];2674 -> 2849[label="",style="solid", color="black", weight=3];
2675[label="primPlusNat (Succ zx1510) (primMulNat zx1520 zx1530)",fontsize=16,color="burlywood",shape="box"];11580[label="zx1520/Succ zx15200",fontsize=10,color="white",style="solid",shape="box"];2675 -> 11580[label="",style="solid", color="burlywood", weight=9];
11580 -> 2850[label="",style="solid", color="burlywood", weight=3];
11581[label="zx1520/Zero",fontsize=10,color="white",style="solid",shape="box"];2675 -> 11581[label="",style="solid", color="burlywood", weight=9];
11581 -> 2851[label="",style="solid", color="burlywood", weight=3];
2676[label="primPlusNat Zero (primMulNat zx1520 zx1530)",fontsize=16,color="burlywood",shape="box"];11582[label="zx1520/Succ zx15200",fontsize=10,color="white",style="solid",shape="box"];2676 -> 11582[label="",style="solid", color="burlywood", weight=9];
11582 -> 2852[label="",style="solid", color="burlywood", weight=3];
11583[label="zx1520/Zero",fontsize=10,color="white",style="solid",shape="box"];2676 -> 11583[label="",style="solid", color="burlywood", weight=9];
11583 -> 2853[label="",style="solid", color="burlywood", weight=3];
2677[label="primMinusNat (Succ zx1510) (primMulNat (Succ zx15200) zx1530)",fontsize=16,color="burlywood",shape="box"];11584[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2677 -> 11584[label="",style="solid", color="burlywood", weight=9];
11584 -> 2854[label="",style="solid", color="burlywood", weight=3];
11585[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2677 -> 11585[label="",style="solid", color="burlywood", weight=9];
11585 -> 2855[label="",style="solid", color="burlywood", weight=3];
2678[label="primMinusNat (Succ zx1510) (primMulNat Zero zx1530)",fontsize=16,color="burlywood",shape="box"];11586[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2678 -> 11586[label="",style="solid", color="burlywood", weight=9];
11586 -> 2856[label="",style="solid", color="burlywood", weight=3];
11587[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2678 -> 11587[label="",style="solid", color="burlywood", weight=9];
11587 -> 2857[label="",style="solid", color="burlywood", weight=3];
2679[label="primMinusNat Zero (primMulNat (Succ zx15200) zx1530)",fontsize=16,color="burlywood",shape="box"];11588[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2679 -> 11588[label="",style="solid", color="burlywood", weight=9];
11588 -> 2858[label="",style="solid", color="burlywood", weight=3];
11589[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2679 -> 11589[label="",style="solid", color="burlywood", weight=9];
11589 -> 2859[label="",style="solid", color="burlywood", weight=3];
2680[label="primMinusNat Zero (primMulNat Zero zx1530)",fontsize=16,color="burlywood",shape="box"];11590[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2680 -> 11590[label="",style="solid", color="burlywood", weight=9];
11590 -> 2860[label="",style="solid", color="burlywood", weight=3];
11591[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2680 -> 11591[label="",style="solid", color="burlywood", weight=9];
11591 -> 2861[label="",style="solid", color="burlywood", weight=3];
2681[label="primMinusNat (primMulNat (Succ zx15900) (Succ zx16000)) zx158",fontsize=16,color="black",shape="box"];2681 -> 2862[label="",style="solid", color="black", weight=3];
2682[label="primMinusNat (primMulNat (Succ zx15900) Zero) zx158",fontsize=16,color="black",shape="box"];2682 -> 2863[label="",style="solid", color="black", weight=3];
2683[label="primMinusNat (primMulNat Zero (Succ zx16000)) zx158",fontsize=16,color="black",shape="box"];2683 -> 2864[label="",style="solid", color="black", weight=3];
2684[label="primMinusNat (primMulNat Zero Zero) zx158",fontsize=16,color="black",shape="box"];2684 -> 2865[label="",style="solid", color="black", weight=3];
2685[label="zx1590",fontsize=16,color="green",shape="box"];2686[label="zx158",fontsize=16,color="green",shape="box"];2687[label="zx1600",fontsize=16,color="green",shape="box"];7056[label="takeWhile (flip (<=) (Integer (Pos (Succ zx444)))) (enforceWHNF (WHNF (Integer (Pos (Succ zx445)) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos (Succ zx445)) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];7056 -> 7063[label="",style="solid", color="black", weight=3];
6104 -> 1663[label="",style="dashed", color="red", weight=0];
6104[label="index (Integer (Neg (Succ zx385)),Integer (Neg (Succ zx386))) (Integer (Neg (Succ zx386)))",fontsize=16,color="magenta"];6104 -> 6107[label="",style="dashed", color="magenta", weight=3];
6104 -> 6108[label="",style="dashed", color="magenta", weight=3];
2725[label="Pos Zero",fontsize=16,color="green",shape="box"];2737[label="Neg Zero",fontsize=16,color="green",shape="box"];2738[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx17600)) (Pos zx1290) == GT))",fontsize=16,color="black",shape="box"];2738 -> 2910[label="",style="solid", color="black", weight=3];
2739[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos (Succ zx17600)) (Neg zx1290) == GT))",fontsize=16,color="black",shape="box"];2739 -> 2911[label="",style="solid", color="black", weight=3];
2740[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Pos zx1290) == GT))",fontsize=16,color="burlywood",shape="box"];11593[label="zx1290/Succ zx12900",fontsize=10,color="white",style="solid",shape="box"];2740 -> 11593[label="",style="solid", color="burlywood", weight=9];
11593 -> 2912[label="",style="solid", color="burlywood", weight=3];
11594[label="zx1290/Zero",fontsize=10,color="white",style="solid",shape="box"];2740 -> 11594[label="",style="solid", color="burlywood", weight=9];
11594 -> 2913[label="",style="solid", color="burlywood", weight=3];
2741[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Neg zx1290) == GT))",fontsize=16,color="burlywood",shape="box"];11595[label="zx1290/Succ zx12900",fontsize=10,color="white",style="solid",shape="box"];2741 -> 11595[label="",style="solid", color="burlywood", weight=9];
11595 -> 2914[label="",style="solid", color="burlywood", weight=3];
11596[label="zx1290/Zero",fontsize=10,color="white",style="solid",shape="box"];2741 -> 11596[label="",style="solid", color="burlywood", weight=9];
11596 -> 2915[label="",style="solid", color="burlywood", weight=3];
2742[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx17600)) (Pos zx1290) == GT))",fontsize=16,color="black",shape="box"];2742 -> 2916[label="",style="solid", color="black", weight=3];
2743[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg (Succ zx17600)) (Neg zx1290) == GT))",fontsize=16,color="black",shape="box"];2743 -> 2917[label="",style="solid", color="black", weight=3];
2744[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Pos zx1290) == GT))",fontsize=16,color="burlywood",shape="box"];11597[label="zx1290/Succ zx12900",fontsize=10,color="white",style="solid",shape="box"];2744 -> 11597[label="",style="solid", color="burlywood", weight=9];
11597 -> 2918[label="",style="solid", color="burlywood", weight=3];
11598[label="zx1290/Zero",fontsize=10,color="white",style="solid",shape="box"];2744 -> 11598[label="",style="solid", color="burlywood", weight=9];
11598 -> 2919[label="",style="solid", color="burlywood", weight=3];
2745[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Neg zx1290) == GT))",fontsize=16,color="burlywood",shape="box"];11599[label="zx1290/Succ zx12900",fontsize=10,color="white",style="solid",shape="box"];2745 -> 11599[label="",style="solid", color="burlywood", weight=9];
11599 -> 2920[label="",style="solid", color="burlywood", weight=3];
11600[label="zx1290/Zero",fontsize=10,color="white",style="solid",shape="box"];2745 -> 11600[label="",style="solid", color="burlywood", weight=9];
11600 -> 2921[label="",style="solid", color="burlywood", weight=3];
2772[label="rangeSize0 LT LT otherwise",fontsize=16,color="black",shape="box"];2772 -> 2950[label="",style="solid", color="black", weight=3];
2773[label="rangeSize1 EQ LT (null (foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2773 -> 2951[label="",style="solid", color="black", weight=3];
2774[label="rangeSize1 GT LT (null (foldr (++) [] (map (range4 LT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2774 -> 2952[label="",style="solid", color="black", weight=3];
2775[label="rangeSize1 LT EQ (null ((++) range40 LT True foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2775 -> 2953[label="",style="solid", color="black", weight=3];
2776[label="rangeSize1 EQ EQ (null ((++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2776 -> 2954[label="",style="solid", color="black", weight=3];
3835[label="(++) range40 LT (not (compare1 LT GT (LT <= GT) == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3835 -> 4097[label="",style="solid", color="black", weight=3];
10709[label="rangeSize1 GT EQ False",fontsize=16,color="black",shape="box"];10709 -> 10718[label="",style="solid", color="black", weight=3];
10710[label="rangeSize1 GT EQ True",fontsize=16,color="black",shape="box"];10710 -> 10719[label="",style="solid", color="black", weight=3];
2778[label="rangeSize1 LT GT (null ((++) range40 LT True foldr (++) [] (map (range4 GT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2778 -> 2956[label="",style="solid", color="black", weight=3];
2779[label="rangeSize1 EQ GT (null ((++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2779 -> 2957[label="",style="solid", color="black", weight=3];
2780[label="rangeSize1 GT GT (null ((++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2780 -> 2958[label="",style="solid", color="black", weight=3];
2781[label="rangeSize0 False False otherwise",fontsize=16,color="black",shape="box"];2781 -> 2959[label="",style="solid", color="black", weight=3];
2782[label="rangeSize1 True False (null (foldr (++) [] (map (range0 False True) (True : []))))",fontsize=16,color="black",shape="box"];2782 -> 2960[label="",style="solid", color="black", weight=3];
2783[label="rangeSize1 False True (null ((++) range00 False True foldr (++) [] (map (range0 True False) (True : []))))",fontsize=16,color="black",shape="box"];2783 -> 2961[label="",style="solid", color="black", weight=3];
2784[label="rangeSize1 True True (null ((++) range00 False (not (LT == LT)) foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];2784 -> 2962[label="",style="solid", color="black", weight=3];
2792[label="[]",fontsize=16,color="green",shape="box"];2793[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (Integer (Pos Zero) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Pos Zero) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2793 -> 2970[label="",style="solid", color="black", weight=3];
2794[label="takeWhile (flip (<=) (Integer (Pos Zero))) (enforceWHNF (WHNF (Integer (Pos Zero) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2794 -> 2971[label="",style="solid", color="black", weight=3];
2795[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (Pos Zero) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2795 -> 2972[label="",style="solid", color="black", weight=3];
2796[label="takeWhile (flip (<=) (Integer (Pos zx31000))) (enforceWHNF (WHNF (Integer (Neg (Succ zx300000)) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg (Succ zx300000)) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2796 -> 2973[label="",style="solid", color="black", weight=3];
7450[label="zx4900",fontsize=16,color="green",shape="box"];7451[label="zx4890",fontsize=16,color="green",shape="box"];7452[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];7452 -> 7459[label="",style="solid", color="black", weight=3];
7453[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="triangle"];7453 -> 7460[label="",style="solid", color="black", weight=3];
7454 -> 7453[label="",style="dashed", color="red", weight=0];
7454[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) (not False)",fontsize=16,color="magenta"];2804[label="takeWhile (flip (<=) (Integer (Neg Zero))) (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2804 -> 2981[label="",style="solid", color="black", weight=3];
2805[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (enforceWHNF (WHNF (Integer (Neg Zero) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2805 -> 2982[label="",style="solid", color="black", weight=3];
2806[label="takeWhile (flip (<=) (Integer (Pos Zero))) (enforceWHNF (WHNF (Integer (Neg Zero) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2806 -> 2983[label="",style="solid", color="black", weight=3];
2807[label="[]",fontsize=16,color="green",shape="box"];2808[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (Neg Zero) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2808 -> 2984[label="",style="solid", color="black", weight=3];
2809[label="(++) range40 LT (not (compare2 LT LT True == LT)) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2809 -> 2985[label="",style="solid", color="black", weight=3];
2810[label="(++) range40 LT (not (compare2 LT EQ False == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2810 -> 2986[label="",style="solid", color="black", weight=3];
2811[label="(++) range40 LT (not (compare2 LT GT False == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2811 -> 2987[label="",style="solid", color="black", weight=3];
2812[label="(++) range40 LT (not (compare LT zx300 == LT)) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2812 -> 2988[label="",style="solid", color="black", weight=3];
2813[label="(++) range40 LT (not (compare LT zx300 == LT)) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2813 -> 2989[label="",style="solid", color="black", weight=3];
2814[label="(++) range00 False (not (compare2 False False True == LT)) foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];2814 -> 2990[label="",style="solid", color="black", weight=3];
2815[label="(++) range00 False (not (compare2 False True False == LT)) foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];2815 -> 2991[label="",style="solid", color="black", weight=3];
2816[label="(++) range00 False (not (compare False zx300 == LT)) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];2816 -> 2992[label="",style="solid", color="black", weight=3];
2817 -> 1693[label="",style="dashed", color="red", weight=0];
2817[label="range (zx400,zx410)",fontsize=16,color="magenta"];2817 -> 2993[label="",style="dashed", color="magenta", weight=3];
2817 -> 2994[label="",style="dashed", color="magenta", weight=3];
2818 -> 1694[label="",style="dashed", color="red", weight=0];
2818[label="range (zx400,zx410)",fontsize=16,color="magenta"];2818 -> 2995[label="",style="dashed", color="magenta", weight=3];
2818 -> 2996[label="",style="dashed", color="magenta", weight=3];
2819 -> 106[label="",style="dashed", color="red", weight=0];
2819[label="range (zx400,zx410)",fontsize=16,color="magenta"];2819 -> 2997[label="",style="dashed", color="magenta", weight=3];
2819 -> 2998[label="",style="dashed", color="magenta", weight=3];
2820 -> 107[label="",style="dashed", color="red", weight=0];
2820[label="range (zx400,zx410)",fontsize=16,color="magenta"];2820 -> 2999[label="",style="dashed", color="magenta", weight=3];
2820 -> 3000[label="",style="dashed", color="magenta", weight=3];
2821 -> 108[label="",style="dashed", color="red", weight=0];
2821[label="range (zx400,zx410)",fontsize=16,color="magenta"];2821 -> 3001[label="",style="dashed", color="magenta", weight=3];
2821 -> 3002[label="",style="dashed", color="magenta", weight=3];
2822 -> 109[label="",style="dashed", color="red", weight=0];
2822[label="range (zx400,zx410)",fontsize=16,color="magenta"];2822 -> 3003[label="",style="dashed", color="magenta", weight=3];
2822 -> 3004[label="",style="dashed", color="magenta", weight=3];
2823 -> 110[label="",style="dashed", color="red", weight=0];
2823[label="range (zx400,zx410)",fontsize=16,color="magenta"];2823 -> 3005[label="",style="dashed", color="magenta", weight=3];
2823 -> 3006[label="",style="dashed", color="magenta", weight=3];
2824 -> 111[label="",style="dashed", color="red", weight=0];
2824[label="range (zx400,zx410)",fontsize=16,color="magenta"];2824 -> 3007[label="",style="dashed", color="magenta", weight=3];
2824 -> 3008[label="",style="dashed", color="magenta", weight=3];
2825 -> 1693[label="",style="dashed", color="red", weight=0];
2825[label="range (zx400,zx410)",fontsize=16,color="magenta"];2825 -> 3009[label="",style="dashed", color="magenta", weight=3];
2825 -> 3010[label="",style="dashed", color="magenta", weight=3];
2826 -> 1694[label="",style="dashed", color="red", weight=0];
2826[label="range (zx400,zx410)",fontsize=16,color="magenta"];2826 -> 3011[label="",style="dashed", color="magenta", weight=3];
2826 -> 3012[label="",style="dashed", color="magenta", weight=3];
2827 -> 106[label="",style="dashed", color="red", weight=0];
2827[label="range (zx400,zx410)",fontsize=16,color="magenta"];2827 -> 3013[label="",style="dashed", color="magenta", weight=3];
2827 -> 3014[label="",style="dashed", color="magenta", weight=3];
2828 -> 107[label="",style="dashed", color="red", weight=0];
2828[label="range (zx400,zx410)",fontsize=16,color="magenta"];2828 -> 3015[label="",style="dashed", color="magenta", weight=3];
2828 -> 3016[label="",style="dashed", color="magenta", weight=3];
2829 -> 108[label="",style="dashed", color="red", weight=0];
2829[label="range (zx400,zx410)",fontsize=16,color="magenta"];2829 -> 3017[label="",style="dashed", color="magenta", weight=3];
2829 -> 3018[label="",style="dashed", color="magenta", weight=3];
2830 -> 109[label="",style="dashed", color="red", weight=0];
2830[label="range (zx400,zx410)",fontsize=16,color="magenta"];2830 -> 3019[label="",style="dashed", color="magenta", weight=3];
2830 -> 3020[label="",style="dashed", color="magenta", weight=3];
2831 -> 110[label="",style="dashed", color="red", weight=0];
2831[label="range (zx400,zx410)",fontsize=16,color="magenta"];2831 -> 3021[label="",style="dashed", color="magenta", weight=3];
2831 -> 3022[label="",style="dashed", color="magenta", weight=3];
2832 -> 111[label="",style="dashed", color="red", weight=0];
2832[label="range (zx400,zx410)",fontsize=16,color="magenta"];2832 -> 3023[label="",style="dashed", color="magenta", weight=3];
2832 -> 3024[label="",style="dashed", color="magenta", weight=3];
2833 -> 1928[label="",style="dashed", color="red", weight=0];
2833[label="foldr (++) [] (map (range1 zx144 zx145) zx1461)",fontsize=16,color="magenta"];2833 -> 3025[label="",style="dashed", color="magenta", weight=3];
2834[label="range1 zx144 zx145 zx1460",fontsize=16,color="black",shape="box"];2834 -> 3026[label="",style="solid", color="black", weight=3];
2835[label="index5 (Integer (Pos zx6400)) (Integer zx670) (Integer zx670) (not (primCmpInt (Pos zx6400) zx670 == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="burlywood",shape="box"];11619[label="zx6400/Succ zx64000",fontsize=10,color="white",style="solid",shape="box"];2835 -> 11619[label="",style="solid", color="burlywood", weight=9];
11619 -> 3027[label="",style="solid", color="burlywood", weight=3];
11620[label="zx6400/Zero",fontsize=10,color="white",style="solid",shape="box"];2835 -> 11620[label="",style="solid", color="burlywood", weight=9];
11620 -> 3028[label="",style="solid", color="burlywood", weight=3];
2836[label="index5 (Integer (Neg zx6400)) (Integer zx670) (Integer zx670) (not (primCmpInt (Neg zx6400) zx670 == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="burlywood",shape="box"];11621[label="zx6400/Succ zx64000",fontsize=10,color="white",style="solid",shape="box"];2836 -> 11621[label="",style="solid", color="burlywood", weight=9];
11621 -> 3029[label="",style="solid", color="burlywood", weight=3];
11622[label="zx6400/Zero",fontsize=10,color="white",style="solid",shape="box"];2836 -> 11622[label="",style="solid", color="burlywood", weight=9];
11622 -> 3030[label="",style="solid", color="burlywood", weight=3];
2837[label="index12 (Pos (Succ zx6400)) (Pos zx670) (Pos zx670) (not (primCmpInt (Pos (Succ zx6400)) (Pos zx670) == GT) && Pos zx670 <= Pos zx670)",fontsize=16,color="black",shape="box"];2837 -> 3031[label="",style="solid", color="black", weight=3];
2838[label="index12 (Pos (Succ zx6400)) (Neg zx670) (Neg zx670) (not (primCmpInt (Pos (Succ zx6400)) (Neg zx670) == GT) && Neg zx670 <= Neg zx670)",fontsize=16,color="black",shape="box"];2838 -> 3032[label="",style="solid", color="black", weight=3];
2839[label="index12 (Pos Zero) (Pos zx670) (Pos zx670) (not (primCmpInt (Pos Zero) (Pos zx670) == GT) && Pos zx670 <= Pos zx670)",fontsize=16,color="burlywood",shape="box"];11623[label="zx670/Succ zx6700",fontsize=10,color="white",style="solid",shape="box"];2839 -> 11623[label="",style="solid", color="burlywood", weight=9];
11623 -> 3033[label="",style="solid", color="burlywood", weight=3];
11624[label="zx670/Zero",fontsize=10,color="white",style="solid",shape="box"];2839 -> 11624[label="",style="solid", color="burlywood", weight=9];
11624 -> 3034[label="",style="solid", color="burlywood", weight=3];
2840[label="index12 (Pos Zero) (Neg zx670) (Neg zx670) (not (primCmpInt (Pos Zero) (Neg zx670) == GT) && Neg zx670 <= Neg zx670)",fontsize=16,color="burlywood",shape="box"];11625[label="zx670/Succ zx6700",fontsize=10,color="white",style="solid",shape="box"];2840 -> 11625[label="",style="solid", color="burlywood", weight=9];
11625 -> 3035[label="",style="solid", color="burlywood", weight=3];
11626[label="zx670/Zero",fontsize=10,color="white",style="solid",shape="box"];2840 -> 11626[label="",style="solid", color="burlywood", weight=9];
11626 -> 3036[label="",style="solid", color="burlywood", weight=3];
2841[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (not (primCmpInt (Neg (Succ zx6400)) (Pos zx670) == GT) && Pos zx670 <= Pos zx670)",fontsize=16,color="black",shape="box"];2841 -> 3037[label="",style="solid", color="black", weight=3];
2842[label="index12 (Neg (Succ zx6400)) (Neg zx670) (Neg zx670) (not (primCmpInt (Neg (Succ zx6400)) (Neg zx670) == GT) && Neg zx670 <= Neg zx670)",fontsize=16,color="black",shape="box"];2842 -> 3038[label="",style="solid", color="black", weight=3];
2843[label="index12 (Neg Zero) (Pos zx670) (Pos zx670) (not (primCmpInt (Neg Zero) (Pos zx670) == GT) && Pos zx670 <= Pos zx670)",fontsize=16,color="burlywood",shape="box"];11627[label="zx670/Succ zx6700",fontsize=10,color="white",style="solid",shape="box"];2843 -> 11627[label="",style="solid", color="burlywood", weight=9];
11627 -> 3039[label="",style="solid", color="burlywood", weight=3];
11628[label="zx670/Zero",fontsize=10,color="white",style="solid",shape="box"];2843 -> 11628[label="",style="solid", color="burlywood", weight=9];
11628 -> 3040[label="",style="solid", color="burlywood", weight=3];
2844[label="index12 (Neg Zero) (Neg zx670) (Neg zx670) (not (primCmpInt (Neg Zero) (Neg zx670) == GT) && Neg zx670 <= Neg zx670)",fontsize=16,color="burlywood",shape="box"];11629[label="zx670/Succ zx6700",fontsize=10,color="white",style="solid",shape="box"];2844 -> 11629[label="",style="solid", color="burlywood", weight=9];
11629 -> 3041[label="",style="solid", color="burlywood", weight=3];
11630[label="zx670/Zero",fontsize=10,color="white",style="solid",shape="box"];2844 -> 11630[label="",style="solid", color="burlywood", weight=9];
11630 -> 3042[label="",style="solid", color="burlywood", weight=3];
2845[label="index3 LT zx64 (not False && LT >= zx64)",fontsize=16,color="black",shape="box"];2845 -> 3043[label="",style="solid", color="black", weight=3];
2846[label="index3 EQ zx64 (not False && EQ >= zx64)",fontsize=16,color="black",shape="box"];2846 -> 3044[label="",style="solid", color="black", weight=3];
2847[label="index3 GT zx64 (not False && GT >= zx64)",fontsize=16,color="black",shape="box"];2847 -> 3045[label="",style="solid", color="black", weight=3];
2848[label="index2 False zx64 (not False && False >= zx64)",fontsize=16,color="black",shape="box"];2848 -> 3046[label="",style="solid", color="black", weight=3];
2849[label="index2 True zx64 (not False && True >= zx64)",fontsize=16,color="black",shape="box"];2849 -> 3047[label="",style="solid", color="black", weight=3];
2850[label="primPlusNat (Succ zx1510) (primMulNat (Succ zx15200) zx1530)",fontsize=16,color="burlywood",shape="box"];11631[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2850 -> 11631[label="",style="solid", color="burlywood", weight=9];
11631 -> 3048[label="",style="solid", color="burlywood", weight=3];
11632[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2850 -> 11632[label="",style="solid", color="burlywood", weight=9];
11632 -> 3049[label="",style="solid", color="burlywood", weight=3];
2851[label="primPlusNat (Succ zx1510) (primMulNat Zero zx1530)",fontsize=16,color="burlywood",shape="box"];11633[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2851 -> 11633[label="",style="solid", color="burlywood", weight=9];
11633 -> 3050[label="",style="solid", color="burlywood", weight=3];
11634[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2851 -> 11634[label="",style="solid", color="burlywood", weight=9];
11634 -> 3051[label="",style="solid", color="burlywood", weight=3];
2852[label="primPlusNat Zero (primMulNat (Succ zx15200) zx1530)",fontsize=16,color="burlywood",shape="box"];11635[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2852 -> 11635[label="",style="solid", color="burlywood", weight=9];
11635 -> 3052[label="",style="solid", color="burlywood", weight=3];
11636[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2852 -> 11636[label="",style="solid", color="burlywood", weight=9];
11636 -> 3053[label="",style="solid", color="burlywood", weight=3];
2853[label="primPlusNat Zero (primMulNat Zero zx1530)",fontsize=16,color="burlywood",shape="box"];11637[label="zx1530/Succ zx15300",fontsize=10,color="white",style="solid",shape="box"];2853 -> 11637[label="",style="solid", color="burlywood", weight=9];
11637 -> 3054[label="",style="solid", color="burlywood", weight=3];
11638[label="zx1530/Zero",fontsize=10,color="white",style="solid",shape="box"];2853 -> 11638[label="",style="solid", color="burlywood", weight=9];
11638 -> 3055[label="",style="solid", color="burlywood", weight=3];
2854[label="primMinusNat (Succ zx1510) (primMulNat (Succ zx15200) (Succ zx15300))",fontsize=16,color="black",shape="box"];2854 -> 3056[label="",style="solid", color="black", weight=3];
2855[label="primMinusNat (Succ zx1510) (primMulNat (Succ zx15200) Zero)",fontsize=16,color="black",shape="box"];2855 -> 3057[label="",style="solid", color="black", weight=3];
2856[label="primMinusNat (Succ zx1510) (primMulNat Zero (Succ zx15300))",fontsize=16,color="black",shape="box"];2856 -> 3058[label="",style="solid", color="black", weight=3];
2857[label="primMinusNat (Succ zx1510) (primMulNat Zero Zero)",fontsize=16,color="black",shape="box"];2857 -> 3059[label="",style="solid", color="black", weight=3];
2858[label="primMinusNat Zero (primMulNat (Succ zx15200) (Succ zx15300))",fontsize=16,color="black",shape="box"];2858 -> 3060[label="",style="solid", color="black", weight=3];
2859[label="primMinusNat Zero (primMulNat (Succ zx15200) Zero)",fontsize=16,color="black",shape="box"];2859 -> 3061[label="",style="solid", color="black", weight=3];
2860[label="primMinusNat Zero (primMulNat Zero (Succ zx15300))",fontsize=16,color="black",shape="box"];2860 -> 3062[label="",style="solid", color="black", weight=3];
2861[label="primMinusNat Zero (primMulNat Zero Zero)",fontsize=16,color="black",shape="box"];2861 -> 3063[label="",style="solid", color="black", weight=3];
2862 -> 3462[label="",style="dashed", color="red", weight=0];
2862[label="primMinusNat (primPlusNat (primMulNat zx15900 (Succ zx16000)) (Succ zx16000)) zx158",fontsize=16,color="magenta"];2862 -> 3463[label="",style="dashed", color="magenta", weight=3];
2863 -> 1658[label="",style="dashed", color="red", weight=0];
2863[label="primMinusNat Zero zx158",fontsize=16,color="magenta"];2863 -> 3066[label="",style="dashed", color="magenta", weight=3];
2864 -> 1658[label="",style="dashed", color="red", weight=0];
2864[label="primMinusNat Zero zx158",fontsize=16,color="magenta"];2864 -> 3067[label="",style="dashed", color="magenta", weight=3];
2865 -> 1658[label="",style="dashed", color="red", weight=0];
2865[label="primMinusNat Zero zx158",fontsize=16,color="magenta"];2865 -> 3068[label="",style="dashed", color="magenta", weight=3];
7063 -> 3179[label="",style="dashed", color="red", weight=0];
7063[label="takeWhile (flip (<=) (Integer (Pos (Succ zx444)))) (enforceWHNF (WHNF (Integer (primPlusInt (Pos (Succ zx445)) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Pos (Succ zx445)) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];7063 -> 7139[label="",style="dashed", color="magenta", weight=3];
7063 -> 7140[label="",style="dashed", color="magenta", weight=3];
7063 -> 7141[label="",style="dashed", color="magenta", weight=3];
6107[label="Integer (Neg (Succ zx385))",fontsize=16,color="green",shape="box"];6108[label="Integer (Neg (Succ zx386))",fontsize=16,color="green",shape="box"];2910[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx17600) zx1290 == GT))",fontsize=16,color="burlywood",shape="triangle"];11644[label="zx1290/Succ zx12900",fontsize=10,color="white",style="solid",shape="box"];2910 -> 11644[label="",style="solid", color="burlywood", weight=9];
11644 -> 3113[label="",style="solid", color="burlywood", weight=3];
11645[label="zx1290/Zero",fontsize=10,color="white",style="solid",shape="box"];2910 -> 11645[label="",style="solid", color="burlywood", weight=9];
11645 -> 3114[label="",style="solid", color="burlywood", weight=3];
2911[label="index8 zx30 zx31 zx31 (not (GT == GT))",fontsize=16,color="black",shape="triangle"];2911 -> 3115[label="",style="solid", color="black", weight=3];
2912[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Pos (Succ zx12900)) == GT))",fontsize=16,color="black",shape="box"];2912 -> 3116[label="",style="solid", color="black", weight=3];
2913[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];2913 -> 3117[label="",style="solid", color="black", weight=3];
2914[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Neg (Succ zx12900)) == GT))",fontsize=16,color="black",shape="box"];2914 -> 3118[label="",style="solid", color="black", weight=3];
2915[label="index8 zx30 zx31 zx31 (not (primCmpInt (Pos Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];2915 -> 3119[label="",style="solid", color="black", weight=3];
2916[label="index8 zx30 zx31 zx31 (not (LT == GT))",fontsize=16,color="black",shape="triangle"];2916 -> 3120[label="",style="solid", color="black", weight=3];
2917[label="index8 zx30 zx31 zx31 (not (primCmpNat zx1290 (Succ zx17600) == GT))",fontsize=16,color="burlywood",shape="triangle"];11646[label="zx1290/Succ zx12900",fontsize=10,color="white",style="solid",shape="box"];2917 -> 11646[label="",style="solid", color="burlywood", weight=9];
11646 -> 3121[label="",style="solid", color="burlywood", weight=3];
11647[label="zx1290/Zero",fontsize=10,color="white",style="solid",shape="box"];2917 -> 11647[label="",style="solid", color="burlywood", weight=9];
11647 -> 3122[label="",style="solid", color="burlywood", weight=3];
2918[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Pos (Succ zx12900)) == GT))",fontsize=16,color="black",shape="box"];2918 -> 3123[label="",style="solid", color="black", weight=3];
2919[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];2919 -> 3124[label="",style="solid", color="black", weight=3];
2920[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Neg (Succ zx12900)) == GT))",fontsize=16,color="black",shape="box"];2920 -> 3125[label="",style="solid", color="black", weight=3];
2921[label="index8 zx30 zx31 zx31 (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];2921 -> 3126[label="",style="solid", color="black", weight=3];
2950[label="rangeSize0 LT LT True",fontsize=16,color="black",shape="box"];2950 -> 3155[label="",style="solid", color="black", weight=3];
2951[label="rangeSize1 EQ LT (null (foldr (++) [] (range4 LT EQ EQ : map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];2951 -> 3156[label="",style="solid", color="black", weight=3];
2952[label="rangeSize1 GT LT (null (foldr (++) [] (range4 LT GT EQ : map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];2952 -> 3157[label="",style="solid", color="black", weight=3];
2953[label="rangeSize1 LT EQ (null ((++) (LT : []) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2953 -> 3158[label="",style="solid", color="black", weight=3];
2954[label="rangeSize1 EQ EQ (null ((++) range40 LT (not True) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2954 -> 3159[label="",style="solid", color="black", weight=3];
4097[label="(++) range40 LT (not (compare1 LT GT True == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4097 -> 4315[label="",style="solid", color="black", weight=3];
10718[label="rangeSize0 GT EQ otherwise",fontsize=16,color="black",shape="box"];10718 -> 10727[label="",style="solid", color="black", weight=3];
10719[label="Pos Zero",fontsize=16,color="green",shape="box"];2956[label="rangeSize1 LT GT (null ((++) (LT : []) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2956 -> 3161[label="",style="solid", color="black", weight=3];
2957[label="rangeSize1 EQ GT (null ((++) range40 LT (not True) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2957 -> 3162[label="",style="solid", color="black", weight=3];
2958[label="rangeSize1 GT GT (null ((++) range40 LT (not True) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];2958 -> 3163[label="",style="solid", color="black", weight=3];
2959[label="rangeSize0 False False True",fontsize=16,color="black",shape="box"];2959 -> 3164[label="",style="solid", color="black", weight=3];
2960[label="rangeSize1 True False (null (foldr (++) [] (range0 False True True : map (range0 False True) [])))",fontsize=16,color="black",shape="box"];2960 -> 3165[label="",style="solid", color="black", weight=3];
2961[label="rangeSize1 False True (null ((++) (False : []) foldr (++) [] (map (range0 True False) (True : []))))",fontsize=16,color="black",shape="box"];2961 -> 3166[label="",style="solid", color="black", weight=3];
2962[label="rangeSize1 True True (null ((++) range00 False (not True) foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];2962 -> 3167[label="",style="solid", color="black", weight=3];
2970[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (enforceWHNF (WHNF (Integer (Pos Zero) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos Zero) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2970 -> 3176[label="",style="solid", color="black", weight=3];
2971[label="takeWhile (flip (<=) (Integer (Pos Zero))) (enforceWHNF (WHNF (Integer (Pos Zero) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos Zero) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2971 -> 3177[label="",style="solid", color="black", weight=3];
2972[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (Pos Zero) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos Zero) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2972 -> 3178[label="",style="solid", color="black", weight=3];
2973 -> 3179[label="",style="dashed", color="red", weight=0];
2973[label="takeWhile (flip (<=) (Integer (Pos zx31000))) (enforceWHNF (WHNF (Integer (primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];2973 -> 3180[label="",style="dashed", color="magenta", weight=3];
2973 -> 3181[label="",style="dashed", color="magenta", weight=3];
7459[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];7459 -> 7464[label="",style="solid", color="black", weight=3];
7460[label="takeWhile1 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];7460 -> 7465[label="",style="solid", color="black", weight=3];
2981[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg (Succ zx300000)) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2981 -> 3193[label="",style="solid", color="black", weight=3];
2982[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (enforceWHNF (WHNF (Integer (Neg Zero) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg Zero) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2982 -> 3194[label="",style="solid", color="black", weight=3];
2983[label="takeWhile (flip (<=) (Integer (Pos Zero))) (enforceWHNF (WHNF (Integer (Neg Zero) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg Zero) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2983 -> 3195[label="",style="solid", color="black", weight=3];
2984[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (Neg Zero) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg Zero) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];2984 -> 3196[label="",style="solid", color="black", weight=3];
2985[label="(++) range40 LT (not (EQ == LT)) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2985 -> 3197[label="",style="solid", color="black", weight=3];
2986[label="(++) range40 LT (not (compare1 LT EQ (LT <= EQ) == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2986 -> 3198[label="",style="solid", color="black", weight=3];
2987[label="(++) range40 LT (not (compare1 LT GT (LT <= GT) == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2987 -> 3199[label="",style="solid", color="black", weight=3];
2988[label="(++) range40 LT (not (compare3 LT zx300 == LT)) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2988 -> 3200[label="",style="solid", color="black", weight=3];
2989[label="(++) range40 LT (not (compare3 LT zx300 == LT)) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="black",shape="box"];2989 -> 3201[label="",style="solid", color="black", weight=3];
2990[label="(++) range00 False (not (EQ == LT)) foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];2990 -> 3202[label="",style="solid", color="black", weight=3];
2991[label="(++) range00 False (not (compare1 False True (False <= True) == LT)) foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];2991 -> 3203[label="",style="solid", color="black", weight=3];
2992[label="(++) range00 False (not (compare3 False zx300 == LT)) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="black",shape="box"];2992 -> 3204[label="",style="solid", color="black", weight=3];
2993[label="zx410",fontsize=16,color="green",shape="box"];2994[label="zx400",fontsize=16,color="green",shape="box"];2995[label="zx410",fontsize=16,color="green",shape="box"];2996[label="zx400",fontsize=16,color="green",shape="box"];2997[label="zx400",fontsize=16,color="green",shape="box"];2998[label="zx410",fontsize=16,color="green",shape="box"];2999[label="zx400",fontsize=16,color="green",shape="box"];3000[label="zx410",fontsize=16,color="green",shape="box"];3001[label="zx400",fontsize=16,color="green",shape="box"];3002[label="zx410",fontsize=16,color="green",shape="box"];3003[label="zx400",fontsize=16,color="green",shape="box"];3004[label="zx410",fontsize=16,color="green",shape="box"];3005[label="zx400",fontsize=16,color="green",shape="box"];3006[label="zx410",fontsize=16,color="green",shape="box"];3007[label="zx400",fontsize=16,color="green",shape="box"];3008[label="zx410",fontsize=16,color="green",shape="box"];3009[label="zx410",fontsize=16,color="green",shape="box"];3010[label="zx400",fontsize=16,color="green",shape="box"];3011[label="zx410",fontsize=16,color="green",shape="box"];3012[label="zx400",fontsize=16,color="green",shape="box"];3013[label="zx400",fontsize=16,color="green",shape="box"];3014[label="zx410",fontsize=16,color="green",shape="box"];3015[label="zx400",fontsize=16,color="green",shape="box"];3016[label="zx410",fontsize=16,color="green",shape="box"];3017[label="zx400",fontsize=16,color="green",shape="box"];3018[label="zx410",fontsize=16,color="green",shape="box"];3019[label="zx400",fontsize=16,color="green",shape="box"];3020[label="zx410",fontsize=16,color="green",shape="box"];3021[label="zx400",fontsize=16,color="green",shape="box"];3022[label="zx410",fontsize=16,color="green",shape="box"];3023[label="zx400",fontsize=16,color="green",shape="box"];3024[label="zx410",fontsize=16,color="green",shape="box"];3025[label="zx1461",fontsize=16,color="green",shape="box"];3026[label="range10 zx144 zx145 zx1460",fontsize=16,color="black",shape="box"];3026 -> 3205[label="",style="solid", color="black", weight=3];
3027[label="index5 (Integer (Pos (Succ zx64000))) (Integer zx670) (Integer zx670) (not (primCmpInt (Pos (Succ zx64000)) zx670 == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="burlywood",shape="box"];11649[label="zx670/Pos zx6700",fontsize=10,color="white",style="solid",shape="box"];3027 -> 11649[label="",style="solid", color="burlywood", weight=9];
11649 -> 3206[label="",style="solid", color="burlywood", weight=3];
11650[label="zx670/Neg zx6700",fontsize=10,color="white",style="solid",shape="box"];3027 -> 11650[label="",style="solid", color="burlywood", weight=9];
11650 -> 3207[label="",style="solid", color="burlywood", weight=3];
3028[label="index5 (Integer (Pos Zero)) (Integer zx670) (Integer zx670) (not (primCmpInt (Pos Zero) zx670 == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="burlywood",shape="box"];11651[label="zx670/Pos zx6700",fontsize=10,color="white",style="solid",shape="box"];3028 -> 11651[label="",style="solid", color="burlywood", weight=9];
11651 -> 3208[label="",style="solid", color="burlywood", weight=3];
11652[label="zx670/Neg zx6700",fontsize=10,color="white",style="solid",shape="box"];3028 -> 11652[label="",style="solid", color="burlywood", weight=9];
11652 -> 3209[label="",style="solid", color="burlywood", weight=3];
3029[label="index5 (Integer (Neg (Succ zx64000))) (Integer zx670) (Integer zx670) (not (primCmpInt (Neg (Succ zx64000)) zx670 == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="burlywood",shape="box"];11653[label="zx670/Pos zx6700",fontsize=10,color="white",style="solid",shape="box"];3029 -> 11653[label="",style="solid", color="burlywood", weight=9];
11653 -> 3210[label="",style="solid", color="burlywood", weight=3];
11654[label="zx670/Neg zx6700",fontsize=10,color="white",style="solid",shape="box"];3029 -> 11654[label="",style="solid", color="burlywood", weight=9];
11654 -> 3211[label="",style="solid", color="burlywood", weight=3];
3030[label="index5 (Integer (Neg Zero)) (Integer zx670) (Integer zx670) (not (primCmpInt (Neg Zero) zx670 == GT) && Integer zx670 <= Integer zx670)",fontsize=16,color="burlywood",shape="box"];11655[label="zx670/Pos zx6700",fontsize=10,color="white",style="solid",shape="box"];3030 -> 11655[label="",style="solid", color="burlywood", weight=9];
11655 -> 3212[label="",style="solid", color="burlywood", weight=3];
11656[label="zx670/Neg zx6700",fontsize=10,color="white",style="solid",shape="box"];3030 -> 11656[label="",style="solid", color="burlywood", weight=9];
11656 -> 3213[label="",style="solid", color="burlywood", weight=3];
3031[label="index12 (Pos (Succ zx6400)) (Pos zx670) (Pos zx670) (not (primCmpNat (Succ zx6400) zx670 == GT) && Pos zx670 <= Pos zx670)",fontsize=16,color="burlywood",shape="box"];11657[label="zx670/Succ zx6700",fontsize=10,color="white",style="solid",shape="box"];3031 -> 11657[label="",style="solid", color="burlywood", weight=9];
11657 -> 3214[label="",style="solid", color="burlywood", weight=3];
11658[label="zx670/Zero",fontsize=10,color="white",style="solid",shape="box"];3031 -> 11658[label="",style="solid", color="burlywood", weight=9];
11658 -> 3215[label="",style="solid", color="burlywood", weight=3];
3032[label="index12 (Pos (Succ zx6400)) (Neg zx670) (Neg zx670) (not (GT == GT) && Neg zx670 <= Neg zx670)",fontsize=16,color="black",shape="box"];3032 -> 3216[label="",style="solid", color="black", weight=3];
3033[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpInt (Pos Zero) (Pos (Succ zx6700)) == GT) && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3033 -> 3217[label="",style="solid", color="black", weight=3];
3034[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == GT) && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3034 -> 3218[label="",style="solid", color="black", weight=3];
3035[label="index12 (Pos Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not (primCmpInt (Pos Zero) (Neg (Succ zx6700)) == GT) && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3035 -> 3219[label="",style="solid", color="black", weight=3];
3036[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (not (primCmpInt (Pos Zero) (Neg Zero) == GT) && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3036 -> 3220[label="",style="solid", color="black", weight=3];
3037[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (not (LT == GT) && Pos zx670 <= Pos zx670)",fontsize=16,color="black",shape="box"];3037 -> 3221[label="",style="solid", color="black", weight=3];
3038[label="index12 (Neg (Succ zx6400)) (Neg zx670) (Neg zx670) (not (primCmpNat zx670 (Succ zx6400) == GT) && Neg zx670 <= Neg zx670)",fontsize=16,color="burlywood",shape="box"];11659[label="zx670/Succ zx6700",fontsize=10,color="white",style="solid",shape="box"];3038 -> 11659[label="",style="solid", color="burlywood", weight=9];
11659 -> 3222[label="",style="solid", color="burlywood", weight=3];
11660[label="zx670/Zero",fontsize=10,color="white",style="solid",shape="box"];3038 -> 11660[label="",style="solid", color="burlywood", weight=9];
11660 -> 3223[label="",style="solid", color="burlywood", weight=3];
3039[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpInt (Neg Zero) (Pos (Succ zx6700)) == GT) && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3039 -> 3224[label="",style="solid", color="black", weight=3];
3040[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (not (primCmpInt (Neg Zero) (Pos Zero) == GT) && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3040 -> 3225[label="",style="solid", color="black", weight=3];
3041[label="index12 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not (primCmpInt (Neg Zero) (Neg (Succ zx6700)) == GT) && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3041 -> 3226[label="",style="solid", color="black", weight=3];
3042[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (not (primCmpInt (Neg Zero) (Neg Zero) == GT) && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3042 -> 3227[label="",style="solid", color="black", weight=3];
3043[label="index3 LT zx64 (True && LT >= zx64)",fontsize=16,color="black",shape="box"];3043 -> 3228[label="",style="solid", color="black", weight=3];
3044[label="index3 EQ zx64 (True && EQ >= zx64)",fontsize=16,color="black",shape="box"];3044 -> 3229[label="",style="solid", color="black", weight=3];
3045[label="index3 GT zx64 (True && GT >= zx64)",fontsize=16,color="black",shape="box"];3045 -> 3230[label="",style="solid", color="black", weight=3];
3046[label="index2 False zx64 (True && False >= zx64)",fontsize=16,color="black",shape="box"];3046 -> 3231[label="",style="solid", color="black", weight=3];
3047[label="index2 True zx64 (True && True >= zx64)",fontsize=16,color="black",shape="box"];3047 -> 3232[label="",style="solid", color="black", weight=3];
3048[label="primPlusNat (Succ zx1510) (primMulNat (Succ zx15200) (Succ zx15300))",fontsize=16,color="black",shape="box"];3048 -> 3233[label="",style="solid", color="black", weight=3];
3049[label="primPlusNat (Succ zx1510) (primMulNat (Succ zx15200) Zero)",fontsize=16,color="black",shape="box"];3049 -> 3234[label="",style="solid", color="black", weight=3];
3050[label="primPlusNat (Succ zx1510) (primMulNat Zero (Succ zx15300))",fontsize=16,color="black",shape="box"];3050 -> 3235[label="",style="solid", color="black", weight=3];
3051[label="primPlusNat (Succ zx1510) (primMulNat Zero Zero)",fontsize=16,color="black",shape="box"];3051 -> 3236[label="",style="solid", color="black", weight=3];
3052[label="primPlusNat Zero (primMulNat (Succ zx15200) (Succ zx15300))",fontsize=16,color="black",shape="box"];3052 -> 3237[label="",style="solid", color="black", weight=3];
3053[label="primPlusNat Zero (primMulNat (Succ zx15200) Zero)",fontsize=16,color="black",shape="box"];3053 -> 3238[label="",style="solid", color="black", weight=3];
3054[label="primPlusNat Zero (primMulNat Zero (Succ zx15300))",fontsize=16,color="black",shape="box"];3054 -> 3239[label="",style="solid", color="black", weight=3];
3055[label="primPlusNat Zero (primMulNat Zero Zero)",fontsize=16,color="black",shape="box"];3055 -> 3240[label="",style="solid", color="black", weight=3];
3056 -> 3688[label="",style="dashed", color="red", weight=0];
3056[label="primMinusNat (Succ zx1510) (primPlusNat (primMulNat zx15200 (Succ zx15300)) (Succ zx15300))",fontsize=16,color="magenta"];3056 -> 3689[label="",style="dashed", color="magenta", weight=3];
3057[label="primMinusNat (Succ zx1510) Zero",fontsize=16,color="black",shape="triangle"];3057 -> 3243[label="",style="solid", color="black", weight=3];
3058 -> 3057[label="",style="dashed", color="red", weight=0];
3058[label="primMinusNat (Succ zx1510) Zero",fontsize=16,color="magenta"];3059 -> 3057[label="",style="dashed", color="red", weight=0];
3059[label="primMinusNat (Succ zx1510) Zero",fontsize=16,color="magenta"];3060 -> 1658[label="",style="dashed", color="red", weight=0];
3060[label="primMinusNat Zero (primPlusNat (primMulNat zx15200 (Succ zx15300)) (Succ zx15300))",fontsize=16,color="magenta"];3060 -> 3244[label="",style="dashed", color="magenta", weight=3];
3061 -> 1658[label="",style="dashed", color="red", weight=0];
3061[label="primMinusNat Zero Zero",fontsize=16,color="magenta"];3061 -> 3245[label="",style="dashed", color="magenta", weight=3];
3062 -> 1658[label="",style="dashed", color="red", weight=0];
3062[label="primMinusNat Zero Zero",fontsize=16,color="magenta"];3062 -> 3246[label="",style="dashed", color="magenta", weight=3];
3063 -> 1658[label="",style="dashed", color="red", weight=0];
3063[label="primMinusNat Zero Zero",fontsize=16,color="magenta"];3063 -> 3247[label="",style="dashed", color="magenta", weight=3];
3463[label="primMulNat zx15900 (Succ zx16000)",fontsize=16,color="burlywood",shape="triangle"];11668[label="zx15900/Succ zx159000",fontsize=10,color="white",style="solid",shape="box"];3463 -> 11668[label="",style="solid", color="burlywood", weight=9];
11668 -> 3467[label="",style="solid", color="burlywood", weight=3];
11669[label="zx15900/Zero",fontsize=10,color="white",style="solid",shape="box"];3463 -> 11669[label="",style="solid", color="burlywood", weight=9];
11669 -> 3468[label="",style="solid", color="burlywood", weight=3];
3462[label="primMinusNat (primPlusNat zx213 (Succ zx16000)) zx158",fontsize=16,color="burlywood",shape="triangle"];11670[label="zx213/Succ zx2130",fontsize=10,color="white",style="solid",shape="box"];3462 -> 11670[label="",style="solid", color="burlywood", weight=9];
11670 -> 3469[label="",style="solid", color="burlywood", weight=3];
11671[label="zx213/Zero",fontsize=10,color="white",style="solid",shape="box"];3462 -> 11671[label="",style="solid", color="burlywood", weight=9];
11671 -> 3470[label="",style="solid", color="burlywood", weight=3];
3066[label="zx158",fontsize=16,color="green",shape="box"];3067[label="zx158",fontsize=16,color="green",shape="box"];3068[label="zx158",fontsize=16,color="green",shape="box"];7139 -> 1395[label="",style="dashed", color="red", weight=0];
7139[label="primPlusInt (Pos (Succ zx445)) (Pos (Succ Zero))",fontsize=16,color="magenta"];7139 -> 7144[label="",style="dashed", color="magenta", weight=3];
7140 -> 1395[label="",style="dashed", color="red", weight=0];
7140[label="primPlusInt (Pos (Succ zx445)) (Pos (Succ Zero))",fontsize=16,color="magenta"];7140 -> 7145[label="",style="dashed", color="magenta", weight=3];
7141[label="Succ zx444",fontsize=16,color="green",shape="box"];3179[label="takeWhile (flip (<=) (Integer (Pos zx31000))) (enforceWHNF (WHNF (Integer zx196)) (numericEnumFrom (Integer zx195)))",fontsize=16,color="black",shape="triangle"];3179 -> 3386[label="",style="solid", color="black", weight=3];
3113[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx17600) (Succ zx12900) == GT))",fontsize=16,color="black",shape="box"];3113 -> 3300[label="",style="solid", color="black", weight=3];
3114[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx17600) Zero == GT))",fontsize=16,color="black",shape="box"];3114 -> 3301[label="",style="solid", color="black", weight=3];
3115[label="index8 zx30 zx31 zx31 (not True)",fontsize=16,color="black",shape="box"];3115 -> 3302[label="",style="solid", color="black", weight=3];
3116 -> 2917[label="",style="dashed", color="red", weight=0];
3116[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero (Succ zx12900) == GT))",fontsize=16,color="magenta"];3116 -> 3303[label="",style="dashed", color="magenta", weight=3];
3116 -> 3304[label="",style="dashed", color="magenta", weight=3];
3117[label="index8 zx30 zx31 zx31 (not (EQ == GT))",fontsize=16,color="black",shape="triangle"];3117 -> 3305[label="",style="solid", color="black", weight=3];
3118 -> 2911[label="",style="dashed", color="red", weight=0];
3118[label="index8 zx30 zx31 zx31 (not (GT == GT))",fontsize=16,color="magenta"];3119 -> 3117[label="",style="dashed", color="red", weight=0];
3119[label="index8 zx30 zx31 zx31 (not (EQ == GT))",fontsize=16,color="magenta"];3120[label="index8 zx30 zx31 zx31 (not False)",fontsize=16,color="black",shape="triangle"];3120 -> 3306[label="",style="solid", color="black", weight=3];
3121[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx12900) (Succ zx17600) == GT))",fontsize=16,color="black",shape="box"];3121 -> 3307[label="",style="solid", color="black", weight=3];
3122[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero (Succ zx17600) == GT))",fontsize=16,color="black",shape="box"];3122 -> 3308[label="",style="solid", color="black", weight=3];
3123 -> 2916[label="",style="dashed", color="red", weight=0];
3123[label="index8 zx30 zx31 zx31 (not (LT == GT))",fontsize=16,color="magenta"];3124 -> 3117[label="",style="dashed", color="red", weight=0];
3124[label="index8 zx30 zx31 zx31 (not (EQ == GT))",fontsize=16,color="magenta"];3125 -> 2910[label="",style="dashed", color="red", weight=0];
3125[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx12900) Zero == GT))",fontsize=16,color="magenta"];3125 -> 3309[label="",style="dashed", color="magenta", weight=3];
3125 -> 3310[label="",style="dashed", color="magenta", weight=3];
3126 -> 3117[label="",style="dashed", color="red", weight=0];
3126[label="index8 zx30 zx31 zx31 (not (EQ == GT))",fontsize=16,color="magenta"];3155 -> 1381[label="",style="dashed", color="red", weight=0];
3155[label="index (LT,LT) LT + Pos (Succ Zero)",fontsize=16,color="magenta"];3155 -> 3354[label="",style="dashed", color="magenta", weight=3];
3156[label="rangeSize1 EQ LT (null ((++) range4 LT EQ EQ foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];3156 -> 3355[label="",style="solid", color="black", weight=3];
3157[label="rangeSize1 GT LT (null ((++) range4 LT GT EQ foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];3157 -> 3356[label="",style="solid", color="black", weight=3];
3158[label="rangeSize1 LT EQ (null (LT : [] ++ foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3158 -> 3357[label="",style="solid", color="black", weight=3];
3159[label="rangeSize1 EQ EQ (null ((++) range40 LT False foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3159 -> 3358[label="",style="solid", color="black", weight=3];
4315[label="(++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4315 -> 4518[label="",style="solid", color="black", weight=3];
10727[label="rangeSize0 GT EQ True",fontsize=16,color="black",shape="box"];10727 -> 10735[label="",style="solid", color="black", weight=3];
3161[label="rangeSize1 LT GT (null (LT : [] ++ foldr (++) [] (map (range4 GT LT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3161 -> 3360[label="",style="solid", color="black", weight=3];
3162[label="rangeSize1 EQ GT (null ((++) range40 LT False foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3162 -> 3361[label="",style="solid", color="black", weight=3];
3163[label="rangeSize1 GT GT (null ((++) range40 LT False foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3163 -> 3362[label="",style="solid", color="black", weight=3];
3164 -> 1381[label="",style="dashed", color="red", weight=0];
3164[label="index (False,False) False + Pos (Succ Zero)",fontsize=16,color="magenta"];3164 -> 3363[label="",style="dashed", color="magenta", weight=3];
3165[label="rangeSize1 True False (null ((++) range0 False True True foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];3165 -> 3364[label="",style="solid", color="black", weight=3];
3166[label="rangeSize1 False True (null (False : [] ++ foldr (++) [] (map (range0 True False) (True : []))))",fontsize=16,color="black",shape="box"];3166 -> 3365[label="",style="solid", color="black", weight=3];
3167[label="rangeSize1 True True (null ((++) range00 False False foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];3167 -> 3366[label="",style="solid", color="black", weight=3];
3176[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (enforceWHNF (WHNF (Integer (Pos Zero) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Pos Zero) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];3176 -> 3377[label="",style="solid", color="black", weight=3];
3177 -> 3179[label="",style="dashed", color="red", weight=0];
3177[label="takeWhile (flip (<=) (Integer (Pos Zero))) (enforceWHNF (WHNF (Integer (primPlusInt (Pos Zero) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Pos Zero) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];3177 -> 3182[label="",style="dashed", color="magenta", weight=3];
3177 -> 3183[label="",style="dashed", color="magenta", weight=3];
3177 -> 3184[label="",style="dashed", color="magenta", weight=3];
3178 -> 3378[label="",style="dashed", color="red", weight=0];
3178[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (primPlusInt (Pos Zero) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Pos Zero) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];3178 -> 3379[label="",style="dashed", color="magenta", weight=3];
3178 -> 3380[label="",style="dashed", color="magenta", weight=3];
3180 -> 1395[label="",style="dashed", color="red", weight=0];
3180[label="primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))",fontsize=16,color="magenta"];3180 -> 3384[label="",style="dashed", color="magenta", weight=3];
3181 -> 1395[label="",style="dashed", color="red", weight=0];
3181[label="primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))",fontsize=16,color="magenta"];3181 -> 3385[label="",style="dashed", color="magenta", weight=3];
7464[label="takeWhile0 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];7464 -> 7528[label="",style="solid", color="black", weight=3];
7465[label="Integer (Neg (Succ zx488)) : takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];7465 -> 7529[label="",style="dashed", color="green", weight=3];
3193[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (Neg (Succ zx300000)) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg (Succ zx300000)) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];3193 -> 3397[label="",style="solid", color="black", weight=3];
3194 -> 3179[label="",style="dashed", color="red", weight=0];
3194[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (enforceWHNF (WHNF (Integer (primPlusInt (Neg Zero) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Neg Zero) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];3194 -> 3398[label="",style="dashed", color="magenta", weight=3];
3194 -> 3399[label="",style="dashed", color="magenta", weight=3];
3194 -> 3400[label="",style="dashed", color="magenta", weight=3];
3195 -> 3179[label="",style="dashed", color="red", weight=0];
3195[label="takeWhile (flip (<=) (Integer (Pos Zero))) (enforceWHNF (WHNF (Integer (primPlusInt (Neg Zero) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Neg Zero) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];3195 -> 3401[label="",style="dashed", color="magenta", weight=3];
3195 -> 3402[label="",style="dashed", color="magenta", weight=3];
3195 -> 3403[label="",style="dashed", color="magenta", weight=3];
3196 -> 3378[label="",style="dashed", color="red", weight=0];
3196[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (primPlusInt (Neg Zero) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Neg Zero) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];3196 -> 3381[label="",style="dashed", color="magenta", weight=3];
3196 -> 3382[label="",style="dashed", color="magenta", weight=3];
3197[label="(++) range40 LT (not False) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3197 -> 3404[label="",style="solid", color="black", weight=3];
3198[label="(++) range40 LT (not (compare1 LT EQ True == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3198 -> 3405[label="",style="solid", color="black", weight=3];
3199[label="(++) range40 LT (not (compare1 LT GT True == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3199 -> 3406[label="",style="solid", color="black", weight=3];
3200[label="(++) range40 LT (not (compare2 LT zx300 (LT == zx300) == LT)) foldr (++) [] (map (range4 EQ zx300) (EQ : GT : []))",fontsize=16,color="burlywood",shape="box"];11690[label="zx300/LT",fontsize=10,color="white",style="solid",shape="box"];3200 -> 11690[label="",style="solid", color="burlywood", weight=9];
11690 -> 3407[label="",style="solid", color="burlywood", weight=3];
11691[label="zx300/EQ",fontsize=10,color="white",style="solid",shape="box"];3200 -> 11691[label="",style="solid", color="burlywood", weight=9];
11691 -> 3408[label="",style="solid", color="burlywood", weight=3];
11692[label="zx300/GT",fontsize=10,color="white",style="solid",shape="box"];3200 -> 11692[label="",style="solid", color="burlywood", weight=9];
11692 -> 3409[label="",style="solid", color="burlywood", weight=3];
3201[label="(++) range40 LT (not (compare2 LT zx300 (LT == zx300) == LT)) foldr (++) [] (map (range4 GT zx300) (EQ : GT : []))",fontsize=16,color="burlywood",shape="box"];11693[label="zx300/LT",fontsize=10,color="white",style="solid",shape="box"];3201 -> 11693[label="",style="solid", color="burlywood", weight=9];
11693 -> 3410[label="",style="solid", color="burlywood", weight=3];
11694[label="zx300/EQ",fontsize=10,color="white",style="solid",shape="box"];3201 -> 11694[label="",style="solid", color="burlywood", weight=9];
11694 -> 3411[label="",style="solid", color="burlywood", weight=3];
11695[label="zx300/GT",fontsize=10,color="white",style="solid",shape="box"];3201 -> 11695[label="",style="solid", color="burlywood", weight=9];
11695 -> 3412[label="",style="solid", color="burlywood", weight=3];
3202[label="(++) range00 False (not False) foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];3202 -> 3413[label="",style="solid", color="black", weight=3];
3203[label="(++) range00 False (not (compare1 False True True == LT)) foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];3203 -> 3414[label="",style="solid", color="black", weight=3];
3204[label="(++) range00 False (not (compare2 False zx300 (False == zx300) == LT)) foldr (++) [] (map (range0 True zx300) (True : []))",fontsize=16,color="burlywood",shape="box"];11696[label="zx300/False",fontsize=10,color="white",style="solid",shape="box"];3204 -> 11696[label="",style="solid", color="burlywood", weight=9];
11696 -> 3415[label="",style="solid", color="burlywood", weight=3];
11697[label="zx300/True",fontsize=10,color="white",style="solid",shape="box"];3204 -> 11697[label="",style="solid", color="burlywood", weight=9];
11697 -> 3416[label="",style="solid", color="burlywood", weight=3];
3205[label="(zx144,zx145,zx1460) : []",fontsize=16,color="green",shape="box"];3206[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (primCmpInt (Pos (Succ zx64000)) (Pos zx6700) == GT) && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="black",shape="box"];3206 -> 3417[label="",style="solid", color="black", weight=3];
3207[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (not (primCmpInt (Pos (Succ zx64000)) (Neg zx6700) == GT) && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="black",shape="box"];3207 -> 3418[label="",style="solid", color="black", weight=3];
3208[label="index5 (Integer (Pos Zero)) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (primCmpInt (Pos Zero) (Pos zx6700) == GT) && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="burlywood",shape="box"];11698[label="zx6700/Succ zx67000",fontsize=10,color="white",style="solid",shape="box"];3208 -> 11698[label="",style="solid", color="burlywood", weight=9];
11698 -> 3419[label="",style="solid", color="burlywood", weight=3];
11699[label="zx6700/Zero",fontsize=10,color="white",style="solid",shape="box"];3208 -> 11699[label="",style="solid", color="burlywood", weight=9];
11699 -> 3420[label="",style="solid", color="burlywood", weight=3];
3209[label="index5 (Integer (Pos Zero)) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (not (primCmpInt (Pos Zero) (Neg zx6700) == GT) && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="burlywood",shape="box"];11700[label="zx6700/Succ zx67000",fontsize=10,color="white",style="solid",shape="box"];3209 -> 11700[label="",style="solid", color="burlywood", weight=9];
11700 -> 3421[label="",style="solid", color="burlywood", weight=3];
11701[label="zx6700/Zero",fontsize=10,color="white",style="solid",shape="box"];3209 -> 11701[label="",style="solid", color="burlywood", weight=9];
11701 -> 3422[label="",style="solid", color="burlywood", weight=3];
3210[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (primCmpInt (Neg (Succ zx64000)) (Pos zx6700) == GT) && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="black",shape="box"];3210 -> 3423[label="",style="solid", color="black", weight=3];
3211[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (not (primCmpInt (Neg (Succ zx64000)) (Neg zx6700) == GT) && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="black",shape="box"];3211 -> 3424[label="",style="solid", color="black", weight=3];
3212[label="index5 (Integer (Neg Zero)) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (primCmpInt (Neg Zero) (Pos zx6700) == GT) && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="burlywood",shape="box"];11702[label="zx6700/Succ zx67000",fontsize=10,color="white",style="solid",shape="box"];3212 -> 11702[label="",style="solid", color="burlywood", weight=9];
11702 -> 3425[label="",style="solid", color="burlywood", weight=3];
11703[label="zx6700/Zero",fontsize=10,color="white",style="solid",shape="box"];3212 -> 11703[label="",style="solid", color="burlywood", weight=9];
11703 -> 3426[label="",style="solid", color="burlywood", weight=3];
3213[label="index5 (Integer (Neg Zero)) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (not (primCmpInt (Neg Zero) (Neg zx6700) == GT) && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="burlywood",shape="box"];11704[label="zx6700/Succ zx67000",fontsize=10,color="white",style="solid",shape="box"];3213 -> 11704[label="",style="solid", color="burlywood", weight=9];
11704 -> 3427[label="",style="solid", color="burlywood", weight=3];
11705[label="zx6700/Zero",fontsize=10,color="white",style="solid",shape="box"];3213 -> 11705[label="",style="solid", color="burlywood", weight=9];
11705 -> 3428[label="",style="solid", color="burlywood", weight=3];
3214[label="index12 (Pos (Succ zx6400)) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpNat (Succ zx6400) (Succ zx6700) == GT) && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3214 -> 3429[label="",style="solid", color="black", weight=3];
3215[label="index12 (Pos (Succ zx6400)) (Pos Zero) (Pos Zero) (not (primCmpNat (Succ zx6400) Zero == GT) && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3215 -> 3430[label="",style="solid", color="black", weight=3];
3216[label="index12 (Pos (Succ zx6400)) (Neg zx670) (Neg zx670) (not True && Neg zx670 <= Neg zx670)",fontsize=16,color="black",shape="box"];3216 -> 3431[label="",style="solid", color="black", weight=3];
3217[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpNat Zero (Succ zx6700) == GT) && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3217 -> 3432[label="",style="solid", color="black", weight=3];
3218[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (not (EQ == GT) && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3218 -> 3433[label="",style="solid", color="black", weight=3];
3219[label="index12 (Pos Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not (GT == GT) && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3219 -> 3434[label="",style="solid", color="black", weight=3];
3220[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (not (EQ == GT) && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3220 -> 3435[label="",style="solid", color="black", weight=3];
3221[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (not False && Pos zx670 <= Pos zx670)",fontsize=16,color="black",shape="box"];3221 -> 3436[label="",style="solid", color="black", weight=3];
3222[label="index12 (Neg (Succ zx6400)) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not (primCmpNat (Succ zx6700) (Succ zx6400) == GT) && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3222 -> 3437[label="",style="solid", color="black", weight=3];
3223[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (not (primCmpNat Zero (Succ zx6400) == GT) && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3223 -> 3438[label="",style="solid", color="black", weight=3];
3224[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (LT == GT) && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3224 -> 3439[label="",style="solid", color="black", weight=3];
3225[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (not (EQ == GT) && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3225 -> 3440[label="",style="solid", color="black", weight=3];
3226[label="index12 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not (primCmpNat (Succ zx6700) Zero == GT) && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3226 -> 3441[label="",style="solid", color="black", weight=3];
3227[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (not (EQ == GT) && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3227 -> 3442[label="",style="solid", color="black", weight=3];
3228[label="index3 LT zx64 (LT >= zx64)",fontsize=16,color="black",shape="box"];3228 -> 3443[label="",style="solid", color="black", weight=3];
3229[label="index3 EQ zx64 (EQ >= zx64)",fontsize=16,color="black",shape="box"];3229 -> 3444[label="",style="solid", color="black", weight=3];
3230[label="index3 GT zx64 (GT >= zx64)",fontsize=16,color="black",shape="box"];3230 -> 3445[label="",style="solid", color="black", weight=3];
3231[label="index2 False zx64 (False >= zx64)",fontsize=16,color="black",shape="box"];3231 -> 3446[label="",style="solid", color="black", weight=3];
3232[label="index2 True zx64 (True >= zx64)",fontsize=16,color="black",shape="box"];3232 -> 3447[label="",style="solid", color="black", weight=3];
3233 -> 3882[label="",style="dashed", color="red", weight=0];
3233[label="primPlusNat (Succ zx1510) (primPlusNat (primMulNat zx15200 (Succ zx15300)) (Succ zx15300))",fontsize=16,color="magenta"];3233 -> 3883[label="",style="dashed", color="magenta", weight=3];
3234 -> 1932[label="",style="dashed", color="red", weight=0];
3234[label="primPlusNat (Succ zx1510) Zero",fontsize=16,color="magenta"];3234 -> 3450[label="",style="dashed", color="magenta", weight=3];
3235 -> 1932[label="",style="dashed", color="red", weight=0];
3235[label="primPlusNat (Succ zx1510) Zero",fontsize=16,color="magenta"];3235 -> 3451[label="",style="dashed", color="magenta", weight=3];
3236 -> 1932[label="",style="dashed", color="red", weight=0];
3236[label="primPlusNat (Succ zx1510) Zero",fontsize=16,color="magenta"];3236 -> 3452[label="",style="dashed", color="magenta", weight=3];
3237 -> 3892[label="",style="dashed", color="red", weight=0];
3237[label="primPlusNat Zero (primPlusNat (primMulNat zx15200 (Succ zx15300)) (Succ zx15300))",fontsize=16,color="magenta"];3237 -> 3893[label="",style="dashed", color="magenta", weight=3];
3238 -> 1932[label="",style="dashed", color="red", weight=0];
3238[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];3238 -> 3455[label="",style="dashed", color="magenta", weight=3];
3239 -> 1932[label="",style="dashed", color="red", weight=0];
3239[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];3239 -> 3456[label="",style="dashed", color="magenta", weight=3];
3240 -> 1932[label="",style="dashed", color="red", weight=0];
3240[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];3240 -> 3457[label="",style="dashed", color="magenta", weight=3];
3689 -> 3463[label="",style="dashed", color="red", weight=0];
3689[label="primMulNat zx15200 (Succ zx15300)",fontsize=16,color="magenta"];3689 -> 3693[label="",style="dashed", color="magenta", weight=3];
3689 -> 3694[label="",style="dashed", color="magenta", weight=3];
3688[label="primMinusNat (Succ zx1510) (primPlusNat zx232 (Succ zx15300))",fontsize=16,color="burlywood",shape="triangle"];11715[label="zx232/Succ zx2320",fontsize=10,color="white",style="solid",shape="box"];3688 -> 11715[label="",style="solid", color="burlywood", weight=9];
11715 -> 3695[label="",style="solid", color="burlywood", weight=3];
11716[label="zx232/Zero",fontsize=10,color="white",style="solid",shape="box"];3688 -> 11716[label="",style="solid", color="burlywood", weight=9];
11716 -> 3696[label="",style="solid", color="burlywood", weight=3];
3243[label="Pos (Succ zx1510)",fontsize=16,color="green",shape="box"];3244 -> 3908[label="",style="dashed", color="red", weight=0];
3244[label="primPlusNat (primMulNat zx15200 (Succ zx15300)) (Succ zx15300)",fontsize=16,color="magenta"];3244 -> 3911[label="",style="dashed", color="magenta", weight=3];
3245[label="Zero",fontsize=16,color="green",shape="box"];3246[label="Zero",fontsize=16,color="green",shape="box"];3247[label="Zero",fontsize=16,color="green",shape="box"];3467[label="primMulNat (Succ zx159000) (Succ zx16000)",fontsize=16,color="black",shape="box"];3467 -> 3476[label="",style="solid", color="black", weight=3];
3468[label="primMulNat Zero (Succ zx16000)",fontsize=16,color="black",shape="box"];3468 -> 3477[label="",style="solid", color="black", weight=3];
3469[label="primMinusNat (primPlusNat (Succ zx2130) (Succ zx16000)) zx158",fontsize=16,color="black",shape="box"];3469 -> 3478[label="",style="solid", color="black", weight=3];
3470[label="primMinusNat (primPlusNat Zero (Succ zx16000)) zx158",fontsize=16,color="black",shape="box"];3470 -> 3479[label="",style="solid", color="black", weight=3];
7144[label="Pos (Succ zx445)",fontsize=16,color="green",shape="box"];7145[label="Pos (Succ zx445)",fontsize=16,color="green",shape="box"];3386 -> 184[label="",style="dashed", color="red", weight=0];
3386[label="takeWhile (flip (<=) (Integer (Pos zx31000))) (numericEnumFrom (Integer zx195))",fontsize=16,color="magenta"];3386 -> 3617[label="",style="dashed", color="magenta", weight=3];
3386 -> 3618[label="",style="dashed", color="magenta", weight=3];
3300[label="index8 zx30 zx31 zx31 (not (primCmpNat zx17600 zx12900 == GT))",fontsize=16,color="burlywood",shape="triangle"];11719[label="zx17600/Succ zx176000",fontsize=10,color="white",style="solid",shape="box"];3300 -> 11719[label="",style="solid", color="burlywood", weight=9];
11719 -> 3531[label="",style="solid", color="burlywood", weight=3];
11720[label="zx17600/Zero",fontsize=10,color="white",style="solid",shape="box"];3300 -> 11720[label="",style="solid", color="burlywood", weight=9];
11720 -> 3532[label="",style="solid", color="burlywood", weight=3];
3301 -> 2911[label="",style="dashed", color="red", weight=0];
3301[label="index8 zx30 zx31 zx31 (not (GT == GT))",fontsize=16,color="magenta"];3302 -> 2360[label="",style="dashed", color="red", weight=0];
3302[label="index8 zx30 zx31 zx31 False",fontsize=16,color="magenta"];3303[label="zx12900",fontsize=16,color="green",shape="box"];3304[label="Zero",fontsize=16,color="green",shape="box"];3305 -> 3120[label="",style="dashed", color="red", weight=0];
3305[label="index8 zx30 zx31 zx31 (not False)",fontsize=16,color="magenta"];3306[label="index8 zx30 zx31 zx31 True",fontsize=16,color="black",shape="box"];3306 -> 3533[label="",style="solid", color="black", weight=3];
3307 -> 3300[label="",style="dashed", color="red", weight=0];
3307[label="index8 zx30 zx31 zx31 (not (primCmpNat zx12900 zx17600 == GT))",fontsize=16,color="magenta"];3307 -> 3534[label="",style="dashed", color="magenta", weight=3];
3307 -> 3535[label="",style="dashed", color="magenta", weight=3];
3308 -> 2916[label="",style="dashed", color="red", weight=0];
3308[label="index8 zx30 zx31 zx31 (not (LT == GT))",fontsize=16,color="magenta"];3309[label="Zero",fontsize=16,color="green",shape="box"];3310[label="zx12900",fontsize=16,color="green",shape="box"];3354 -> 1667[label="",style="dashed", color="red", weight=0];
3354[label="index (LT,LT) LT",fontsize=16,color="magenta"];3354 -> 3585[label="",style="dashed", color="magenta", weight=3];
3354 -> 3586[label="",style="dashed", color="magenta", weight=3];
3355[label="rangeSize1 EQ LT (null ((++) range40 EQ (LT >= EQ && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];3355 -> 3587[label="",style="solid", color="black", weight=3];
3356[label="rangeSize1 GT LT (null ((++) range40 EQ (LT >= EQ && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];3356 -> 3588[label="",style="solid", color="black", weight=3];
3357[label="rangeSize1 LT EQ False",fontsize=16,color="black",shape="box"];3357 -> 3589[label="",style="solid", color="black", weight=3];
3358[label="rangeSize1 EQ EQ (null ((++) [] foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3358 -> 3590[label="",style="solid", color="black", weight=3];
4518[label="(++) range40 LT (not True) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4518 -> 4834[label="",style="solid", color="black", weight=3];
10735 -> 1381[label="",style="dashed", color="red", weight=0];
10735[label="index (GT,EQ) EQ + Pos (Succ Zero)",fontsize=16,color="magenta"];10735 -> 10743[label="",style="dashed", color="magenta", weight=3];
3360[label="rangeSize1 LT GT False",fontsize=16,color="black",shape="box"];3360 -> 3592[label="",style="solid", color="black", weight=3];
3361[label="rangeSize1 EQ GT (null ((++) [] foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3361 -> 3593[label="",style="solid", color="black", weight=3];
3362[label="rangeSize1 GT GT (null ((++) [] foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3362 -> 3594[label="",style="solid", color="black", weight=3];
3363 -> 1668[label="",style="dashed", color="red", weight=0];
3363[label="index (False,False) False",fontsize=16,color="magenta"];3363 -> 3595[label="",style="dashed", color="magenta", weight=3];
3363 -> 3596[label="",style="dashed", color="magenta", weight=3];
3364[label="rangeSize1 True False (null ((++) range00 True (False >= True && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];3364 -> 3597[label="",style="solid", color="black", weight=3];
3365[label="rangeSize1 False True False",fontsize=16,color="black",shape="box"];3365 -> 3598[label="",style="solid", color="black", weight=3];
3366[label="rangeSize1 True True (null ((++) [] foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];3366 -> 3599[label="",style="solid", color="black", weight=3];
3377 -> 3179[label="",style="dashed", color="red", weight=0];
3377[label="takeWhile (flip (<=) (Integer (Pos (Succ zx310000)))) (enforceWHNF (WHNF (Integer (primPlusInt (Pos Zero) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Pos Zero) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];3377 -> 3609[label="",style="dashed", color="magenta", weight=3];
3377 -> 3610[label="",style="dashed", color="magenta", weight=3];
3377 -> 3611[label="",style="dashed", color="magenta", weight=3];
3182 -> 1395[label="",style="dashed", color="red", weight=0];
3182[label="primPlusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3182 -> 3612[label="",style="dashed", color="magenta", weight=3];
3183 -> 1395[label="",style="dashed", color="red", weight=0];
3183[label="primPlusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3183 -> 3613[label="",style="dashed", color="magenta", weight=3];
3184[label="Zero",fontsize=16,color="green",shape="box"];3379 -> 1395[label="",style="dashed", color="red", weight=0];
3379[label="primPlusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3379 -> 3614[label="",style="dashed", color="magenta", weight=3];
3380 -> 1395[label="",style="dashed", color="red", weight=0];
3380[label="primPlusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3380 -> 3615[label="",style="dashed", color="magenta", weight=3];
3378[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer zx212)) (numericEnumFrom (Integer zx211)))",fontsize=16,color="black",shape="triangle"];3378 -> 3616[label="",style="solid", color="black", weight=3];
3384[label="Neg (Succ zx300000)",fontsize=16,color="green",shape="box"];3385[label="Neg (Succ zx300000)",fontsize=16,color="green",shape="box"];7528[label="takeWhile0 (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];7528 -> 7546[label="",style="solid", color="black", weight=3];
7529[label="takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (numericEnumFrom $! Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];7529 -> 7547[label="",style="solid", color="black", weight=3];
3397 -> 3378[label="",style="dashed", color="red", weight=0];
3397[label="takeWhile (flip (<=) (Integer (Neg Zero))) (enforceWHNF (WHNF (Integer (primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];3397 -> 3628[label="",style="dashed", color="magenta", weight=3];
3397 -> 3629[label="",style="dashed", color="magenta", weight=3];
3398 -> 1395[label="",style="dashed", color="red", weight=0];
3398[label="primPlusInt (Neg Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3398 -> 3630[label="",style="dashed", color="magenta", weight=3];
3399 -> 1395[label="",style="dashed", color="red", weight=0];
3399[label="primPlusInt (Neg Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3399 -> 3631[label="",style="dashed", color="magenta", weight=3];
3400[label="Succ zx310000",fontsize=16,color="green",shape="box"];3401 -> 1395[label="",style="dashed", color="red", weight=0];
3401[label="primPlusInt (Neg Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3401 -> 3632[label="",style="dashed", color="magenta", weight=3];
3402 -> 1395[label="",style="dashed", color="red", weight=0];
3402[label="primPlusInt (Neg Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3402 -> 3633[label="",style="dashed", color="magenta", weight=3];
3403[label="Zero",fontsize=16,color="green",shape="box"];3381 -> 1395[label="",style="dashed", color="red", weight=0];
3381[label="primPlusInt (Neg Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3381 -> 3634[label="",style="dashed", color="magenta", weight=3];
3382 -> 1395[label="",style="dashed", color="red", weight=0];
3382[label="primPlusInt (Neg Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3382 -> 3635[label="",style="dashed", color="magenta", weight=3];
3404[label="(++) range40 LT True foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3404 -> 3636[label="",style="solid", color="black", weight=3];
3405[label="(++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3405 -> 3637[label="",style="solid", color="black", weight=3];
3406[label="(++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3406 -> 3638[label="",style="solid", color="black", weight=3];
3407[label="(++) range40 LT (not (compare2 LT LT (LT == LT) == LT)) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3407 -> 3639[label="",style="solid", color="black", weight=3];
3408[label="(++) range40 LT (not (compare2 LT EQ (LT == EQ) == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3408 -> 3640[label="",style="solid", color="black", weight=3];
3409[label="(++) range40 LT (not (compare2 LT GT (LT == GT) == LT)) foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3409 -> 3641[label="",style="solid", color="black", weight=3];
3410[label="(++) range40 LT (not (compare2 LT LT (LT == LT) == LT)) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3410 -> 3642[label="",style="solid", color="black", weight=3];
3411[label="(++) range40 LT (not (compare2 LT EQ (LT == EQ) == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3411 -> 3643[label="",style="solid", color="black", weight=3];
3412[label="(++) range40 LT (not (compare2 LT GT (LT == GT) == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3412 -> 3644[label="",style="solid", color="black", weight=3];
3413[label="(++) range00 False True foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];3413 -> 3645[label="",style="solid", color="black", weight=3];
3414[label="(++) range00 False (not (LT == LT)) foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];3414 -> 3646[label="",style="solid", color="black", weight=3];
3415[label="(++) range00 False (not (compare2 False False (False == False) == LT)) foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];3415 -> 3647[label="",style="solid", color="black", weight=3];
3416[label="(++) range00 False (not (compare2 False True (False == True) == LT)) foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];3416 -> 3648[label="",style="solid", color="black", weight=3];
3417[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (primCmpNat (Succ zx64000) zx6700 == GT) && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="burlywood",shape="box"];11741[label="zx6700/Succ zx67000",fontsize=10,color="white",style="solid",shape="box"];3417 -> 11741[label="",style="solid", color="burlywood", weight=9];
11741 -> 3649[label="",style="solid", color="burlywood", weight=3];
11742[label="zx6700/Zero",fontsize=10,color="white",style="solid",shape="box"];3417 -> 11742[label="",style="solid", color="burlywood", weight=9];
11742 -> 3650[label="",style="solid", color="burlywood", weight=3];
3418[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (not (GT == GT) && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="black",shape="box"];3418 -> 3651[label="",style="solid", color="black", weight=3];
3419[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpInt (Pos Zero) (Pos (Succ zx67000)) == GT) && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];3419 -> 3652[label="",style="solid", color="black", weight=3];
3420[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT) && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3420 -> 3653[label="",style="solid", color="black", weight=3];
3421[label="index5 (Integer (Pos Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not (primCmpInt (Pos Zero) (Neg (Succ zx67000)) == GT) && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];3421 -> 3654[label="",style="solid", color="black", weight=3];
3422[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (primCmpInt (Pos Zero) (Neg Zero) == GT) && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3422 -> 3655[label="",style="solid", color="black", weight=3];
3423[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (LT == GT) && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="black",shape="box"];3423 -> 3656[label="",style="solid", color="black", weight=3];
3424[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (not (primCmpNat zx6700 (Succ zx64000) == GT) && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="burlywood",shape="box"];11743[label="zx6700/Succ zx67000",fontsize=10,color="white",style="solid",shape="box"];3424 -> 11743[label="",style="solid", color="burlywood", weight=9];
11743 -> 3657[label="",style="solid", color="burlywood", weight=3];
11744[label="zx6700/Zero",fontsize=10,color="white",style="solid",shape="box"];3424 -> 11744[label="",style="solid", color="burlywood", weight=9];
11744 -> 3658[label="",style="solid", color="burlywood", weight=3];
3425[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpInt (Neg Zero) (Pos (Succ zx67000)) == GT) && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];3425 -> 3659[label="",style="solid", color="black", weight=3];
3426[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == GT) && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3426 -> 3660[label="",style="solid", color="black", weight=3];
3427[label="index5 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not (primCmpInt (Neg Zero) (Neg (Succ zx67000)) == GT) && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];3427 -> 3661[label="",style="solid", color="black", weight=3];
3428[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Neg Zero) == GT) && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3428 -> 3662[label="",style="solid", color="black", weight=3];
3429 -> 8876[label="",style="dashed", color="red", weight=0];
3429[label="index12 (Pos (Succ zx6400)) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpNat zx6400 zx6700 == GT) && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="magenta"];3429 -> 8877[label="",style="dashed", color="magenta", weight=3];
3429 -> 8878[label="",style="dashed", color="magenta", weight=3];
3429 -> 8879[label="",style="dashed", color="magenta", weight=3];
3429 -> 8880[label="",style="dashed", color="magenta", weight=3];
3430[label="index12 (Pos (Succ zx6400)) (Pos Zero) (Pos Zero) (not (GT == GT) && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3430 -> 3665[label="",style="solid", color="black", weight=3];
3431[label="index12 (Pos (Succ zx6400)) (Neg zx670) (Neg zx670) (False && Neg zx670 <= Neg zx670)",fontsize=16,color="black",shape="box"];3431 -> 3666[label="",style="solid", color="black", weight=3];
3432[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (LT == GT) && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3432 -> 3667[label="",style="solid", color="black", weight=3];
3433[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (not False && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3433 -> 3668[label="",style="solid", color="black", weight=3];
3434[label="index12 (Pos Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not True && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3434 -> 3669[label="",style="solid", color="black", weight=3];
3435[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (not False && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3435 -> 3670[label="",style="solid", color="black", weight=3];
3436[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (True && Pos zx670 <= Pos zx670)",fontsize=16,color="black",shape="box"];3436 -> 3671[label="",style="solid", color="black", weight=3];
3437 -> 8921[label="",style="dashed", color="red", weight=0];
3437[label="index12 (Neg (Succ zx6400)) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not (primCmpNat zx6700 zx6400 == GT) && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="magenta"];3437 -> 8922[label="",style="dashed", color="magenta", weight=3];
3437 -> 8923[label="",style="dashed", color="magenta", weight=3];
3437 -> 8924[label="",style="dashed", color="magenta", weight=3];
3437 -> 8925[label="",style="dashed", color="magenta", weight=3];
3438[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (not (LT == GT) && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3438 -> 3674[label="",style="solid", color="black", weight=3];
3439[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not False && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3439 -> 3675[label="",style="solid", color="black", weight=3];
3440[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (not False && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3440 -> 3676[label="",style="solid", color="black", weight=3];
3441[label="index12 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not (GT == GT) && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3441 -> 3677[label="",style="solid", color="black", weight=3];
3442[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (not False && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3442 -> 3678[label="",style="solid", color="black", weight=3];
3443[label="index3 LT zx64 (compare LT zx64 /= LT)",fontsize=16,color="black",shape="box"];3443 -> 3679[label="",style="solid", color="black", weight=3];
3444[label="index3 EQ zx64 (compare EQ zx64 /= LT)",fontsize=16,color="black",shape="box"];3444 -> 3680[label="",style="solid", color="black", weight=3];
3445[label="index3 GT zx64 (compare GT zx64 /= LT)",fontsize=16,color="black",shape="box"];3445 -> 3681[label="",style="solid", color="black", weight=3];
3446[label="index2 False zx64 (compare False zx64 /= LT)",fontsize=16,color="black",shape="box"];3446 -> 3682[label="",style="solid", color="black", weight=3];
3447[label="index2 True zx64 (compare True zx64 /= LT)",fontsize=16,color="black",shape="box"];3447 -> 3683[label="",style="solid", color="black", weight=3];
3883 -> 3463[label="",style="dashed", color="red", weight=0];
3883[label="primMulNat zx15200 (Succ zx15300)",fontsize=16,color="magenta"];3883 -> 3888[label="",style="dashed", color="magenta", weight=3];
3883 -> 3889[label="",style="dashed", color="magenta", weight=3];
3882[label="primPlusNat (Succ zx1510) (primPlusNat zx241 (Succ zx15300))",fontsize=16,color="burlywood",shape="triangle"];11748[label="zx241/Succ zx2410",fontsize=10,color="white",style="solid",shape="box"];3882 -> 11748[label="",style="solid", color="burlywood", weight=9];
11748 -> 3890[label="",style="solid", color="burlywood", weight=3];
11749[label="zx241/Zero",fontsize=10,color="white",style="solid",shape="box"];3882 -> 11749[label="",style="solid", color="burlywood", weight=9];
11749 -> 3891[label="",style="solid", color="burlywood", weight=3];
3450[label="Succ zx1510",fontsize=16,color="green",shape="box"];1932[label="primPlusNat zx12700 Zero",fontsize=16,color="burlywood",shape="triangle"];11750[label="zx12700/Succ zx127000",fontsize=10,color="white",style="solid",shape="box"];1932 -> 11750[label="",style="solid", color="burlywood", weight=9];
11750 -> 1948[label="",style="solid", color="burlywood", weight=3];
11751[label="zx12700/Zero",fontsize=10,color="white",style="solid",shape="box"];1932 -> 11751[label="",style="solid", color="burlywood", weight=9];
11751 -> 1949[label="",style="solid", color="burlywood", weight=3];
3451[label="Succ zx1510",fontsize=16,color="green",shape="box"];3452[label="Succ zx1510",fontsize=16,color="green",shape="box"];3893 -> 3463[label="",style="dashed", color="red", weight=0];
3893[label="primMulNat zx15200 (Succ zx15300)",fontsize=16,color="magenta"];3893 -> 3898[label="",style="dashed", color="magenta", weight=3];
3893 -> 3899[label="",style="dashed", color="magenta", weight=3];
3892[label="primPlusNat Zero (primPlusNat zx243 (Succ zx15300))",fontsize=16,color="burlywood",shape="triangle"];11753[label="zx243/Succ zx2430",fontsize=10,color="white",style="solid",shape="box"];3892 -> 11753[label="",style="solid", color="burlywood", weight=9];
11753 -> 3900[label="",style="solid", color="burlywood", weight=3];
11754[label="zx243/Zero",fontsize=10,color="white",style="solid",shape="box"];3892 -> 11754[label="",style="solid", color="burlywood", weight=9];
11754 -> 3901[label="",style="solid", color="burlywood", weight=3];
3455[label="Zero",fontsize=16,color="green",shape="box"];3456[label="Zero",fontsize=16,color="green",shape="box"];3457[label="Zero",fontsize=16,color="green",shape="box"];3693[label="zx15200",fontsize=16,color="green",shape="box"];3694[label="zx15300",fontsize=16,color="green",shape="box"];3695[label="primMinusNat (Succ zx1510) (primPlusNat (Succ zx2320) (Succ zx15300))",fontsize=16,color="black",shape="box"];3695 -> 3738[label="",style="solid", color="black", weight=3];
3696[label="primMinusNat (Succ zx1510) (primPlusNat Zero (Succ zx15300))",fontsize=16,color="black",shape="box"];3696 -> 3739[label="",style="solid", color="black", weight=3];
3911 -> 3463[label="",style="dashed", color="red", weight=0];
3911[label="primMulNat zx15200 (Succ zx15300)",fontsize=16,color="magenta"];3911 -> 3924[label="",style="dashed", color="magenta", weight=3];
3911 -> 3925[label="",style="dashed", color="magenta", weight=3];
3476 -> 3908[label="",style="dashed", color="red", weight=0];
3476[label="primPlusNat (primMulNat zx159000 (Succ zx16000)) (Succ zx16000)",fontsize=16,color="magenta"];3476 -> 3912[label="",style="dashed", color="magenta", weight=3];
3476 -> 3913[label="",style="dashed", color="magenta", weight=3];
3477[label="Zero",fontsize=16,color="green",shape="box"];3478[label="primMinusNat (Succ (Succ (primPlusNat zx2130 zx16000))) zx158",fontsize=16,color="burlywood",shape="box"];11757[label="zx158/Succ zx1580",fontsize=10,color="white",style="solid",shape="box"];3478 -> 11757[label="",style="solid", color="burlywood", weight=9];
11757 -> 3701[label="",style="solid", color="burlywood", weight=3];
11758[label="zx158/Zero",fontsize=10,color="white",style="solid",shape="box"];3478 -> 11758[label="",style="solid", color="burlywood", weight=9];
11758 -> 3702[label="",style="solid", color="burlywood", weight=3];
3479[label="primMinusNat (Succ zx16000) zx158",fontsize=16,color="burlywood",shape="triangle"];11759[label="zx158/Succ zx1580",fontsize=10,color="white",style="solid",shape="box"];3479 -> 11759[label="",style="solid", color="burlywood", weight=9];
11759 -> 3703[label="",style="solid", color="burlywood", weight=3];
11760[label="zx158/Zero",fontsize=10,color="white",style="solid",shape="box"];3479 -> 11760[label="",style="solid", color="burlywood", weight=9];
11760 -> 3704[label="",style="solid", color="burlywood", weight=3];
3617[label="Integer zx195",fontsize=16,color="green",shape="box"];3618[label="Integer (Pos zx31000)",fontsize=16,color="green",shape="box"];3531[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx176000) zx12900 == GT))",fontsize=16,color="burlywood",shape="box"];11761[label="zx12900/Succ zx129000",fontsize=10,color="white",style="solid",shape="box"];3531 -> 11761[label="",style="solid", color="burlywood", weight=9];
11761 -> 3763[label="",style="solid", color="burlywood", weight=3];
11762[label="zx12900/Zero",fontsize=10,color="white",style="solid",shape="box"];3531 -> 11762[label="",style="solid", color="burlywood", weight=9];
11762 -> 3764[label="",style="solid", color="burlywood", weight=3];
3532[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero zx12900 == GT))",fontsize=16,color="burlywood",shape="box"];11763[label="zx12900/Succ zx129000",fontsize=10,color="white",style="solid",shape="box"];3532 -> 11763[label="",style="solid", color="burlywood", weight=9];
11763 -> 3765[label="",style="solid", color="burlywood", weight=3];
11764[label="zx12900/Zero",fontsize=10,color="white",style="solid",shape="box"];3532 -> 11764[label="",style="solid", color="burlywood", weight=9];
11764 -> 3766[label="",style="solid", color="burlywood", weight=3];
3533 -> 3767[label="",style="dashed", color="red", weight=0];
3533[label="fromEnum zx31 - fromEnum zx30",fontsize=16,color="magenta"];3533 -> 3768[label="",style="dashed", color="magenta", weight=3];
3533 -> 3769[label="",style="dashed", color="magenta", weight=3];
3534[label="zx17600",fontsize=16,color="green",shape="box"];3535[label="zx12900",fontsize=16,color="green",shape="box"];3585[label="LT",fontsize=16,color="green",shape="box"];3586[label="LT",fontsize=16,color="green",shape="box"];3587[label="rangeSize1 EQ LT (null ((++) range40 EQ (compare LT EQ /= LT && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];3587 -> 3793[label="",style="solid", color="black", weight=3];
3588[label="rangeSize1 GT LT (null ((++) range40 EQ (compare LT EQ /= LT && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];3588 -> 3794[label="",style="solid", color="black", weight=3];
3589[label="rangeSize0 LT EQ otherwise",fontsize=16,color="black",shape="box"];3589 -> 3795[label="",style="solid", color="black", weight=3];
3590[label="rangeSize1 EQ EQ (null (foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3590 -> 3796[label="",style="solid", color="black", weight=3];
4834[label="(++) range40 LT False foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4834 -> 5032[label="",style="solid", color="black", weight=3];
10743 -> 1667[label="",style="dashed", color="red", weight=0];
10743[label="index (GT,EQ) EQ",fontsize=16,color="magenta"];10743 -> 10751[label="",style="dashed", color="magenta", weight=3];
10743 -> 10752[label="",style="dashed", color="magenta", weight=3];
3592[label="rangeSize0 LT GT otherwise",fontsize=16,color="black",shape="box"];3592 -> 3798[label="",style="solid", color="black", weight=3];
3593[label="rangeSize1 EQ GT (null (foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3593 -> 3799[label="",style="solid", color="black", weight=3];
3594[label="rangeSize1 GT GT (null (foldr (++) [] (map (range4 GT GT) (EQ : GT : []))))",fontsize=16,color="black",shape="box"];3594 -> 3800[label="",style="solid", color="black", weight=3];
3595[label="False",fontsize=16,color="green",shape="box"];3596[label="False",fontsize=16,color="green",shape="box"];3597[label="rangeSize1 True False (null ((++) range00 True (compare False True /= LT && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];3597 -> 3801[label="",style="solid", color="black", weight=3];
3598[label="rangeSize0 False True otherwise",fontsize=16,color="black",shape="box"];3598 -> 3802[label="",style="solid", color="black", weight=3];
3599[label="rangeSize1 True True (null (foldr (++) [] (map (range0 True True) (True : []))))",fontsize=16,color="black",shape="box"];3599 -> 3803[label="",style="solid", color="black", weight=3];
3609 -> 1395[label="",style="dashed", color="red", weight=0];
3609[label="primPlusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3609 -> 3814[label="",style="dashed", color="magenta", weight=3];
3610 -> 1395[label="",style="dashed", color="red", weight=0];
3610[label="primPlusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="magenta"];3610 -> 3815[label="",style="dashed", color="magenta", weight=3];
3611[label="Succ zx310000",fontsize=16,color="green",shape="box"];3612[label="Pos Zero",fontsize=16,color="green",shape="box"];3613[label="Pos Zero",fontsize=16,color="green",shape="box"];3614[label="Pos Zero",fontsize=16,color="green",shape="box"];3615[label="Pos Zero",fontsize=16,color="green",shape="box"];3616 -> 184[label="",style="dashed", color="red", weight=0];
3616[label="takeWhile (flip (<=) (Integer (Neg Zero))) (numericEnumFrom (Integer zx211))",fontsize=16,color="magenta"];3616 -> 3816[label="",style="dashed", color="magenta", weight=3];
3616 -> 3817[label="",style="dashed", color="magenta", weight=3];
7546[label="[]",fontsize=16,color="green",shape="box"];7547[label="takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];7547 -> 7561[label="",style="solid", color="black", weight=3];
3628 -> 1395[label="",style="dashed", color="red", weight=0];
3628[label="primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))",fontsize=16,color="magenta"];3628 -> 3828[label="",style="dashed", color="magenta", weight=3];
3629 -> 1395[label="",style="dashed", color="red", weight=0];
3629[label="primPlusInt (Neg (Succ zx300000)) (Pos (Succ Zero))",fontsize=16,color="magenta"];3629 -> 3829[label="",style="dashed", color="magenta", weight=3];
3630[label="Neg Zero",fontsize=16,color="green",shape="box"];3631[label="Neg Zero",fontsize=16,color="green",shape="box"];3632[label="Neg Zero",fontsize=16,color="green",shape="box"];3633[label="Neg Zero",fontsize=16,color="green",shape="box"];3634[label="Neg Zero",fontsize=16,color="green",shape="box"];3635[label="Neg Zero",fontsize=16,color="green",shape="box"];3636[label="(++) (LT : []) foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3636 -> 3830[label="",style="solid", color="black", weight=3];
3637[label="(++) range40 LT (not True) foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3637 -> 3831[label="",style="solid", color="black", weight=3];
3638[label="(++) range40 LT (not True) foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3638 -> 3832[label="",style="solid", color="black", weight=3];
3639[label="(++) range40 LT (not (compare2 LT LT True == LT)) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3639 -> 3833[label="",style="solid", color="black", weight=3];
3640[label="(++) range40 LT (not (compare2 LT EQ False == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3640 -> 3834[label="",style="solid", color="black", weight=3];
3642[label="(++) range40 LT (not (compare2 LT LT True == LT)) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3642 -> 3836[label="",style="solid", color="black", weight=3];
3643[label="(++) range40 LT (not (compare2 LT EQ False == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3643 -> 3837[label="",style="solid", color="black", weight=3];
3644[label="(++) range40 LT (not (compare2 LT GT False == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3644 -> 3838[label="",style="solid", color="black", weight=3];
3645[label="(++) (False : []) foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];3645 -> 3839[label="",style="solid", color="black", weight=3];
3646[label="(++) range00 False (not True) foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];3646 -> 3840[label="",style="solid", color="black", weight=3];
3647[label="(++) range00 False (not (compare2 False False True == LT)) foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];3647 -> 3841[label="",style="solid", color="black", weight=3];
3648[label="(++) range00 False (not (compare2 False True False == LT)) foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];3648 -> 3842[label="",style="solid", color="black", weight=3];
3649[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpNat (Succ zx64000) (Succ zx67000) == GT) && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];3649 -> 3843[label="",style="solid", color="black", weight=3];
3650[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (primCmpNat (Succ zx64000) Zero == GT) && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3650 -> 3844[label="",style="solid", color="black", weight=3];
3651[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (not True && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="black",shape="box"];3651 -> 3845[label="",style="solid", color="black", weight=3];
3652[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpNat Zero (Succ zx67000) == GT) && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];3652 -> 3846[label="",style="solid", color="black", weight=3];
3653[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (EQ == GT) && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3653 -> 3847[label="",style="solid", color="black", weight=3];
3654[label="index5 (Integer (Pos Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not (GT == GT) && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];3654 -> 3848[label="",style="solid", color="black", weight=3];
3655[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (EQ == GT) && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3655 -> 3849[label="",style="solid", color="black", weight=3];
3656[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not False && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="black",shape="box"];3656 -> 3850[label="",style="solid", color="black", weight=3];
3657[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not (primCmpNat (Succ zx67000) (Succ zx64000) == GT) && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];3657 -> 3851[label="",style="solid", color="black", weight=3];
3658[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (primCmpNat Zero (Succ zx64000) == GT) && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3658 -> 3852[label="",style="solid", color="black", weight=3];
3659[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (LT == GT) && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];3659 -> 3853[label="",style="solid", color="black", weight=3];
3660[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (EQ == GT) && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3660 -> 3854[label="",style="solid", color="black", weight=3];
3661[label="index5 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not (primCmpNat (Succ zx67000) Zero == GT) && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];3661 -> 3855[label="",style="solid", color="black", weight=3];
3662[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (EQ == GT) && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3662 -> 3856[label="",style="solid", color="black", weight=3];
8877[label="zx6700",fontsize=16,color="green",shape="box"];8878[label="zx6400",fontsize=16,color="green",shape="box"];8879[label="zx6400",fontsize=16,color="green",shape="box"];8880[label="zx6700",fontsize=16,color="green",shape="box"];8876[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat zx628 zx629 == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="burlywood",shape="triangle"];11772[label="zx628/Succ zx6280",fontsize=10,color="white",style="solid",shape="box"];8876 -> 11772[label="",style="solid", color="burlywood", weight=9];
11772 -> 8917[label="",style="solid", color="burlywood", weight=3];
11773[label="zx628/Zero",fontsize=10,color="white",style="solid",shape="box"];8876 -> 11773[label="",style="solid", color="burlywood", weight=9];
11773 -> 8918[label="",style="solid", color="burlywood", weight=3];
3665[label="index12 (Pos (Succ zx6400)) (Pos Zero) (Pos Zero) (not True && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3665 -> 3861[label="",style="solid", color="black", weight=3];
3666[label="index12 (Pos (Succ zx6400)) (Neg zx670) (Neg zx670) False",fontsize=16,color="black",shape="box"];3666 -> 3862[label="",style="solid", color="black", weight=3];
3667[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not False && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3667 -> 3863[label="",style="solid", color="black", weight=3];
3668[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (True && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3668 -> 3864[label="",style="solid", color="black", weight=3];
3669[label="index12 (Pos Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (False && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3669 -> 3865[label="",style="solid", color="black", weight=3];
3670[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (True && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3670 -> 3866[label="",style="solid", color="black", weight=3];
3671[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (Pos zx670 <= Pos zx670)",fontsize=16,color="black",shape="box"];3671 -> 3867[label="",style="solid", color="black", weight=3];
8922[label="zx6700",fontsize=16,color="green",shape="box"];8923[label="zx6400",fontsize=16,color="green",shape="box"];8924[label="zx6400",fontsize=16,color="green",shape="box"];8925[label="zx6700",fontsize=16,color="green",shape="box"];8921[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat zx633 zx634 == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="burlywood",shape="triangle"];11774[label="zx633/Succ zx6330",fontsize=10,color="white",style="solid",shape="box"];8921 -> 11774[label="",style="solid", color="burlywood", weight=9];
11774 -> 8962[label="",style="solid", color="burlywood", weight=3];
11775[label="zx633/Zero",fontsize=10,color="white",style="solid",shape="box"];8921 -> 11775[label="",style="solid", color="burlywood", weight=9];
11775 -> 8963[label="",style="solid", color="burlywood", weight=3];
3674[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (not False && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3674 -> 3872[label="",style="solid", color="black", weight=3];
3675[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (True && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3675 -> 3873[label="",style="solid", color="black", weight=3];
3676[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (True && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3676 -> 3874[label="",style="solid", color="black", weight=3];
3677[label="index12 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (not True && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3677 -> 3875[label="",style="solid", color="black", weight=3];
3678[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (True && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3678 -> 3876[label="",style="solid", color="black", weight=3];
3679[label="index3 LT zx64 (not (compare LT zx64 == LT))",fontsize=16,color="black",shape="box"];3679 -> 3877[label="",style="solid", color="black", weight=3];
3680[label="index3 EQ zx64 (not (compare EQ zx64 == LT))",fontsize=16,color="black",shape="box"];3680 -> 3878[label="",style="solid", color="black", weight=3];
3681[label="index3 GT zx64 (not (compare GT zx64 == LT))",fontsize=16,color="black",shape="box"];3681 -> 3879[label="",style="solid", color="black", weight=3];
3682[label="index2 False zx64 (not (compare False zx64 == LT))",fontsize=16,color="black",shape="box"];3682 -> 3880[label="",style="solid", color="black", weight=3];
3683[label="index2 True zx64 (not (compare True zx64 == LT))",fontsize=16,color="black",shape="box"];3683 -> 3881[label="",style="solid", color="black", weight=3];
3888[label="zx15200",fontsize=16,color="green",shape="box"];3889[label="zx15300",fontsize=16,color="green",shape="box"];3890[label="primPlusNat (Succ zx1510) (primPlusNat (Succ zx2410) (Succ zx15300))",fontsize=16,color="black",shape="box"];3890 -> 3902[label="",style="solid", color="black", weight=3];
3891[label="primPlusNat (Succ zx1510) (primPlusNat Zero (Succ zx15300))",fontsize=16,color="black",shape="box"];3891 -> 3903[label="",style="solid", color="black", weight=3];
1948[label="primPlusNat (Succ zx127000) Zero",fontsize=16,color="black",shape="box"];1948 -> 1958[label="",style="solid", color="black", weight=3];
1949[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];1949 -> 1959[label="",style="solid", color="black", weight=3];
3898[label="zx15200",fontsize=16,color="green",shape="box"];3899[label="zx15300",fontsize=16,color="green",shape="box"];3900[label="primPlusNat Zero (primPlusNat (Succ zx2430) (Succ zx15300))",fontsize=16,color="black",shape="box"];3900 -> 3926[label="",style="solid", color="black", weight=3];
3901[label="primPlusNat Zero (primPlusNat Zero (Succ zx15300))",fontsize=16,color="black",shape="box"];3901 -> 3927[label="",style="solid", color="black", weight=3];
3738 -> 3479[label="",style="dashed", color="red", weight=0];
3738[label="primMinusNat (Succ zx1510) (Succ (Succ (primPlusNat zx2320 zx15300)))",fontsize=16,color="magenta"];3738 -> 3904[label="",style="dashed", color="magenta", weight=3];
3738 -> 3905[label="",style="dashed", color="magenta", weight=3];
3739 -> 3479[label="",style="dashed", color="red", weight=0];
3739[label="primMinusNat (Succ zx1510) (Succ zx15300)",fontsize=16,color="magenta"];3739 -> 3906[label="",style="dashed", color="magenta", weight=3];
3739 -> 3907[label="",style="dashed", color="magenta", weight=3];
3924[label="zx15200",fontsize=16,color="green",shape="box"];3925[label="zx15300",fontsize=16,color="green",shape="box"];3912[label="zx16000",fontsize=16,color="green",shape="box"];3913 -> 3463[label="",style="dashed", color="red", weight=0];
3913[label="primMulNat zx159000 (Succ zx16000)",fontsize=16,color="magenta"];3913 -> 3928[label="",style="dashed", color="magenta", weight=3];
3701[label="primMinusNat (Succ (Succ (primPlusNat zx2130 zx16000))) (Succ zx1580)",fontsize=16,color="black",shape="box"];3701 -> 3929[label="",style="solid", color="black", weight=3];
3702[label="primMinusNat (Succ (Succ (primPlusNat zx2130 zx16000))) Zero",fontsize=16,color="black",shape="box"];3702 -> 3930[label="",style="solid", color="black", weight=3];
3703[label="primMinusNat (Succ zx16000) (Succ zx1580)",fontsize=16,color="black",shape="box"];3703 -> 3931[label="",style="solid", color="black", weight=3];
3704[label="primMinusNat (Succ zx16000) Zero",fontsize=16,color="black",shape="box"];3704 -> 3932[label="",style="solid", color="black", weight=3];
3763[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx176000) (Succ zx129000) == GT))",fontsize=16,color="black",shape="box"];3763 -> 3986[label="",style="solid", color="black", weight=3];
3764[label="index8 zx30 zx31 zx31 (not (primCmpNat (Succ zx176000) Zero == GT))",fontsize=16,color="black",shape="box"];3764 -> 3987[label="",style="solid", color="black", weight=3];
3765[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero (Succ zx129000) == GT))",fontsize=16,color="black",shape="box"];3765 -> 3988[label="",style="solid", color="black", weight=3];
3766[label="index8 zx30 zx31 zx31 (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];3766 -> 3989[label="",style="solid", color="black", weight=3];
3768 -> 220[label="",style="dashed", color="red", weight=0];
3768[label="fromEnum zx30",fontsize=16,color="magenta"];3768 -> 3990[label="",style="dashed", color="magenta", weight=3];
3769 -> 220[label="",style="dashed", color="red", weight=0];
3769[label="fromEnum zx31",fontsize=16,color="magenta"];3769 -> 3991[label="",style="dashed", color="magenta", weight=3];
3767[label="zx238 - zx237",fontsize=16,color="black",shape="triangle"];3767 -> 3992[label="",style="solid", color="black", weight=3];
3793[label="rangeSize1 EQ LT (null ((++) range40 EQ (not (compare LT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];3793 -> 4057[label="",style="solid", color="black", weight=3];
3794[label="rangeSize1 GT LT (null ((++) range40 EQ (not (compare LT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];3794 -> 4058[label="",style="solid", color="black", weight=3];
3795[label="rangeSize0 LT EQ True",fontsize=16,color="black",shape="box"];3795 -> 4059[label="",style="solid", color="black", weight=3];
3796[label="rangeSize1 EQ EQ (null (foldr (++) [] (range4 EQ EQ EQ : map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];3796 -> 4060[label="",style="solid", color="black", weight=3];
5032[label="(++) [] foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5032 -> 5225[label="",style="solid", color="black", weight=3];
10751[label="GT",fontsize=16,color="green",shape="box"];10752[label="EQ",fontsize=16,color="green",shape="box"];3798[label="rangeSize0 LT GT True",fontsize=16,color="black",shape="box"];3798 -> 4062[label="",style="solid", color="black", weight=3];
3799[label="rangeSize1 EQ GT (null (foldr (++) [] (range4 GT EQ EQ : map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];3799 -> 4063[label="",style="solid", color="black", weight=3];
3800[label="rangeSize1 GT GT (null (foldr (++) [] (range4 GT GT EQ : map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];3800 -> 4064[label="",style="solid", color="black", weight=3];
3801[label="rangeSize1 True False (null ((++) range00 True (not (compare False True == LT) && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];3801 -> 4065[label="",style="solid", color="black", weight=3];
3802[label="rangeSize0 False True True",fontsize=16,color="black",shape="box"];3802 -> 4066[label="",style="solid", color="black", weight=3];
3803[label="rangeSize1 True True (null (foldr (++) [] (range0 True True True : map (range0 True True) [])))",fontsize=16,color="black",shape="box"];3803 -> 4067[label="",style="solid", color="black", weight=3];
3814[label="Pos Zero",fontsize=16,color="green",shape="box"];3815[label="Pos Zero",fontsize=16,color="green",shape="box"];3816[label="Integer zx211",fontsize=16,color="green",shape="box"];3817[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];7561[label="takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (enforceWHNF (WHNF (Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg (Succ zx488)) + fromInt (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];7561 -> 7642[label="",style="solid", color="black", weight=3];
3828[label="Neg (Succ zx300000)",fontsize=16,color="green",shape="box"];3829[label="Neg (Succ zx300000)",fontsize=16,color="green",shape="box"];3830[label="LT : [] ++ foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="green",shape="box"];3830 -> 4092[label="",style="dashed", color="green", weight=3];
3831[label="(++) range40 LT False foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3831 -> 4093[label="",style="solid", color="black", weight=3];
3832[label="(++) range40 LT False foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3832 -> 4094[label="",style="solid", color="black", weight=3];
3833[label="(++) range40 LT (not (EQ == LT)) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3833 -> 4095[label="",style="solid", color="black", weight=3];
3834[label="(++) range40 LT (not (compare1 LT EQ (LT <= EQ) == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3834 -> 4096[label="",style="solid", color="black", weight=3];
3836[label="(++) range40 LT (not (EQ == LT)) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3836 -> 4098[label="",style="solid", color="black", weight=3];
3837[label="(++) range40 LT (not (compare1 LT EQ (LT <= EQ) == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3837 -> 4099[label="",style="solid", color="black", weight=3];
3838[label="(++) range40 LT (not (compare1 LT GT (LT <= GT) == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];3838 -> 4100[label="",style="solid", color="black", weight=3];
3839[label="False : [] ++ foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="green",shape="box"];3839 -> 4101[label="",style="dashed", color="green", weight=3];
3840[label="(++) range00 False False foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];3840 -> 4102[label="",style="solid", color="black", weight=3];
3841[label="(++) range00 False (not (EQ == LT)) foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];3841 -> 4103[label="",style="solid", color="black", weight=3];
3842[label="(++) range00 False (not (compare1 False True (False <= True) == LT)) foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];3842 -> 4104[label="",style="solid", color="black", weight=3];
3843 -> 9161[label="",style="dashed", color="red", weight=0];
3843[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpNat zx64000 zx67000 == GT) && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="magenta"];3843 -> 9162[label="",style="dashed", color="magenta", weight=3];
3843 -> 9163[label="",style="dashed", color="magenta", weight=3];
3843 -> 9164[label="",style="dashed", color="magenta", weight=3];
3843 -> 9165[label="",style="dashed", color="magenta", weight=3];
3844[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (GT == GT) && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3844 -> 4107[label="",style="solid", color="black", weight=3];
3845[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) (False && Integer (Neg zx6700) <= Integer (Neg zx6700))",fontsize=16,color="black",shape="box"];3845 -> 4108[label="",style="solid", color="black", weight=3];
3846[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (LT == GT) && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];3846 -> 4109[label="",style="solid", color="black", weight=3];
3847[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not False && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3847 -> 4110[label="",style="solid", color="black", weight=3];
3848[label="index5 (Integer (Pos Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not True && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];3848 -> 4111[label="",style="solid", color="black", weight=3];
3849[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not False && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3849 -> 4112[label="",style="solid", color="black", weight=3];
3850[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (True && Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="black",shape="box"];3850 -> 4113[label="",style="solid", color="black", weight=3];
3851 -> 9210[label="",style="dashed", color="red", weight=0];
3851[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not (primCmpNat zx67000 zx64000 == GT) && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="magenta"];3851 -> 9211[label="",style="dashed", color="magenta", weight=3];
3851 -> 9212[label="",style="dashed", color="magenta", weight=3];
3851 -> 9213[label="",style="dashed", color="magenta", weight=3];
3851 -> 9214[label="",style="dashed", color="magenta", weight=3];
3852[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (LT == GT) && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3852 -> 4116[label="",style="solid", color="black", weight=3];
3853[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not False && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];3853 -> 4117[label="",style="solid", color="black", weight=3];
3854[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not False && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];3854 -> 4118[label="",style="solid", color="black", weight=3];
3855[label="index5 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not (GT == GT) && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];3855 -> 4119[label="",style="solid", color="black", weight=3];
3856[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not False && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];3856 -> 4120[label="",style="solid", color="black", weight=3];
8917[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat (Succ zx6280) zx629 == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="burlywood",shape="box"];11783[label="zx629/Succ zx6290",fontsize=10,color="white",style="solid",shape="box"];8917 -> 11783[label="",style="solid", color="burlywood", weight=9];
11783 -> 8964[label="",style="solid", color="burlywood", weight=3];
11784[label="zx629/Zero",fontsize=10,color="white",style="solid",shape="box"];8917 -> 11784[label="",style="solid", color="burlywood", weight=9];
11784 -> 8965[label="",style="solid", color="burlywood", weight=3];
8918[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat Zero zx629 == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="burlywood",shape="box"];11785[label="zx629/Succ zx6290",fontsize=10,color="white",style="solid",shape="box"];8918 -> 11785[label="",style="solid", color="burlywood", weight=9];
11785 -> 8966[label="",style="solid", color="burlywood", weight=3];
11786[label="zx629/Zero",fontsize=10,color="white",style="solid",shape="box"];8918 -> 11786[label="",style="solid", color="burlywood", weight=9];
11786 -> 8967[label="",style="solid", color="burlywood", weight=3];
3861[label="index12 (Pos (Succ zx6400)) (Pos Zero) (Pos Zero) (False && Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3861 -> 4125[label="",style="solid", color="black", weight=3];
3862[label="index11 (Pos (Succ zx6400)) (Neg zx670) (Neg zx670) otherwise",fontsize=16,color="black",shape="box"];3862 -> 4126[label="",style="solid", color="black", weight=3];
3863[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (True && Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3863 -> 4127[label="",style="solid", color="black", weight=3];
3864[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3864 -> 4128[label="",style="solid", color="black", weight=3];
3865[label="index12 (Pos Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) False",fontsize=16,color="black",shape="box"];3865 -> 4129[label="",style="solid", color="black", weight=3];
3866[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3866 -> 4130[label="",style="solid", color="black", weight=3];
3867[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (compare (Pos zx670) (Pos zx670) /= GT)",fontsize=16,color="black",shape="box"];3867 -> 4131[label="",style="solid", color="black", weight=3];
8962[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat (Succ zx6330) zx634 == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="burlywood",shape="box"];11787[label="zx634/Succ zx6340",fontsize=10,color="white",style="solid",shape="box"];8962 -> 11787[label="",style="solid", color="burlywood", weight=9];
11787 -> 9016[label="",style="solid", color="burlywood", weight=3];
11788[label="zx634/Zero",fontsize=10,color="white",style="solid",shape="box"];8962 -> 11788[label="",style="solid", color="burlywood", weight=9];
11788 -> 9017[label="",style="solid", color="burlywood", weight=3];
8963[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat Zero zx634 == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="burlywood",shape="box"];11789[label="zx634/Succ zx6340",fontsize=10,color="white",style="solid",shape="box"];8963 -> 11789[label="",style="solid", color="burlywood", weight=9];
11789 -> 9018[label="",style="solid", color="burlywood", weight=3];
11790[label="zx634/Zero",fontsize=10,color="white",style="solid",shape="box"];8963 -> 11790[label="",style="solid", color="burlywood", weight=9];
11790 -> 9019[label="",style="solid", color="burlywood", weight=3];
3872[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (True && Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3872 -> 4136[label="",style="solid", color="black", weight=3];
3873[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];3873 -> 4137[label="",style="solid", color="black", weight=3];
3874[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (Pos Zero <= Pos Zero)",fontsize=16,color="black",shape="box"];3874 -> 4138[label="",style="solid", color="black", weight=3];
3875[label="index12 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) (False && Neg (Succ zx6700) <= Neg (Succ zx6700))",fontsize=16,color="black",shape="box"];3875 -> 4139[label="",style="solid", color="black", weight=3];
3876[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];3876 -> 4140[label="",style="solid", color="black", weight=3];
3877[label="index3 LT zx64 (not (compare3 LT zx64 == LT))",fontsize=16,color="black",shape="box"];3877 -> 4141[label="",style="solid", color="black", weight=3];
3878[label="index3 EQ zx64 (not (compare3 EQ zx64 == LT))",fontsize=16,color="black",shape="box"];3878 -> 4142[label="",style="solid", color="black", weight=3];
3879[label="index3 GT zx64 (not (compare3 GT zx64 == LT))",fontsize=16,color="black",shape="box"];3879 -> 4143[label="",style="solid", color="black", weight=3];
3880[label="index2 False zx64 (not (compare3 False zx64 == LT))",fontsize=16,color="black",shape="box"];3880 -> 4144[label="",style="solid", color="black", weight=3];
3881[label="index2 True zx64 (not (compare3 True zx64 == LT))",fontsize=16,color="black",shape="box"];3881 -> 4145[label="",style="solid", color="black", weight=3];
3902 -> 3908[label="",style="dashed", color="red", weight=0];
3902[label="primPlusNat (Succ zx1510) (Succ (Succ (primPlusNat zx2410 zx15300)))",fontsize=16,color="magenta"];3902 -> 3916[label="",style="dashed", color="magenta", weight=3];
3902 -> 3917[label="",style="dashed", color="magenta", weight=3];
3903 -> 3908[label="",style="dashed", color="red", weight=0];
3903[label="primPlusNat (Succ zx1510) (Succ zx15300)",fontsize=16,color="magenta"];3903 -> 3918[label="",style="dashed", color="magenta", weight=3];
3903 -> 3919[label="",style="dashed", color="magenta", weight=3];
1958[label="Succ zx127000",fontsize=16,color="green",shape="box"];1959[label="Zero",fontsize=16,color="green",shape="box"];3926 -> 4010[label="",style="dashed", color="red", weight=0];
3926[label="primPlusNat Zero (Succ (Succ (primPlusNat zx2430 zx15300)))",fontsize=16,color="magenta"];3926 -> 4146[label="",style="dashed", color="magenta", weight=3];
3926 -> 4147[label="",style="dashed", color="magenta", weight=3];
3927 -> 4010[label="",style="dashed", color="red", weight=0];
3927[label="primPlusNat Zero (Succ zx15300)",fontsize=16,color="magenta"];3927 -> 4148[label="",style="dashed", color="magenta", weight=3];
3927 -> 4149[label="",style="dashed", color="magenta", weight=3];
3904[label="Succ (Succ (primPlusNat zx2320 zx15300))",fontsize=16,color="green",shape="box"];3904 -> 4150[label="",style="dashed", color="green", weight=3];
3905[label="zx1510",fontsize=16,color="green",shape="box"];3906[label="Succ zx15300",fontsize=16,color="green",shape="box"];3907[label="zx1510",fontsize=16,color="green",shape="box"];3928[label="zx159000",fontsize=16,color="green",shape="box"];3929 -> 3479[label="",style="dashed", color="red", weight=0];
3929[label="primMinusNat (Succ (primPlusNat zx2130 zx16000)) zx1580",fontsize=16,color="magenta"];3929 -> 4151[label="",style="dashed", color="magenta", weight=3];
3929 -> 4152[label="",style="dashed", color="magenta", weight=3];
3930[label="Pos (Succ (Succ (primPlusNat zx2130 zx16000)))",fontsize=16,color="green",shape="box"];3930 -> 4153[label="",style="dashed", color="green", weight=3];
3931[label="primMinusNat zx16000 zx1580",fontsize=16,color="burlywood",shape="triangle"];11796[label="zx16000/Succ zx160000",fontsize=10,color="white",style="solid",shape="box"];3931 -> 11796[label="",style="solid", color="burlywood", weight=9];
11796 -> 4154[label="",style="solid", color="burlywood", weight=3];
11797[label="zx16000/Zero",fontsize=10,color="white",style="solid",shape="box"];3931 -> 11797[label="",style="solid", color="burlywood", weight=9];
11797 -> 4155[label="",style="solid", color="burlywood", weight=3];
3932[label="Pos (Succ zx16000)",fontsize=16,color="green",shape="box"];3986 -> 3300[label="",style="dashed", color="red", weight=0];
3986[label="index8 zx30 zx31 zx31 (not (primCmpNat zx176000 zx129000 == GT))",fontsize=16,color="magenta"];3986 -> 4255[label="",style="dashed", color="magenta", weight=3];
3986 -> 4256[label="",style="dashed", color="magenta", weight=3];
3987 -> 2911[label="",style="dashed", color="red", weight=0];
3987[label="index8 zx30 zx31 zx31 (not (GT == GT))",fontsize=16,color="magenta"];3988 -> 2916[label="",style="dashed", color="red", weight=0];
3988[label="index8 zx30 zx31 zx31 (not (LT == GT))",fontsize=16,color="magenta"];3989 -> 3117[label="",style="dashed", color="red", weight=0];
3989[label="index8 zx30 zx31 zx31 (not (EQ == GT))",fontsize=16,color="magenta"];3990[label="zx30",fontsize=16,color="green",shape="box"];3991[label="zx31",fontsize=16,color="green",shape="box"];3992[label="primMinusInt zx238 zx237",fontsize=16,color="burlywood",shape="triangle"];11802[label="zx238/Pos zx2380",fontsize=10,color="white",style="solid",shape="box"];3992 -> 11802[label="",style="solid", color="burlywood", weight=9];
11802 -> 4257[label="",style="solid", color="burlywood", weight=3];
11803[label="zx238/Neg zx2380",fontsize=10,color="white",style="solid",shape="box"];3992 -> 11803[label="",style="solid", color="burlywood", weight=9];
11803 -> 4258[label="",style="solid", color="burlywood", weight=3];
4057[label="rangeSize1 EQ LT (null ((++) range40 EQ (not (compare3 LT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4057 -> 4269[label="",style="solid", color="black", weight=3];
4058[label="rangeSize1 GT LT (null ((++) range40 EQ (not (compare3 LT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4058 -> 4270[label="",style="solid", color="black", weight=3];
4059 -> 1381[label="",style="dashed", color="red", weight=0];
4059[label="index (LT,EQ) EQ + Pos (Succ Zero)",fontsize=16,color="magenta"];4059 -> 4271[label="",style="dashed", color="magenta", weight=3];
4060[label="rangeSize1 EQ EQ (null ((++) range4 EQ EQ EQ foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4060 -> 4272[label="",style="solid", color="black", weight=3];
5225[label="foldr (++) [] (map (range4 EQ GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5225 -> 5392[label="",style="solid", color="black", weight=3];
4062 -> 1381[label="",style="dashed", color="red", weight=0];
4062[label="index (LT,GT) GT + Pos (Succ Zero)",fontsize=16,color="magenta"];4062 -> 4274[label="",style="dashed", color="magenta", weight=3];
4063[label="rangeSize1 EQ GT (null ((++) range4 GT EQ EQ foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4063 -> 4275[label="",style="solid", color="black", weight=3];
4064[label="rangeSize1 GT GT (null ((++) range4 GT GT EQ foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4064 -> 4276[label="",style="solid", color="black", weight=3];
4065[label="rangeSize1 True False (null ((++) range00 True (not (compare3 False True == LT) && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];4065 -> 4277[label="",style="solid", color="black", weight=3];
4066 -> 1381[label="",style="dashed", color="red", weight=0];
4066[label="index (False,True) True + Pos (Succ Zero)",fontsize=16,color="magenta"];4066 -> 4278[label="",style="dashed", color="magenta", weight=3];
4067[label="rangeSize1 True True (null ((++) range0 True True True foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];4067 -> 4279[label="",style="solid", color="black", weight=3];
7642[label="takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (enforceWHNF (WHNF (Integer (Neg (Succ zx488)) + Integer (Pos (Succ Zero)))) (numericEnumFrom (Integer (Neg (Succ zx488)) + Integer (Pos (Succ Zero)))))",fontsize=16,color="black",shape="box"];7642 -> 7664[label="",style="solid", color="black", weight=3];
4092[label="[] ++ foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4092 -> 4310[label="",style="solid", color="black", weight=3];
4093[label="(++) [] foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4093 -> 4311[label="",style="solid", color="black", weight=3];
4094[label="(++) [] foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4094 -> 4312[label="",style="solid", color="black", weight=3];
4095[label="(++) range40 LT (not False) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4095 -> 4313[label="",style="solid", color="black", weight=3];
4096[label="(++) range40 LT (not (compare1 LT EQ True == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4096 -> 4314[label="",style="solid", color="black", weight=3];
4098[label="(++) range40 LT (not False) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4098 -> 4316[label="",style="solid", color="black", weight=3];
4099[label="(++) range40 LT (not (compare1 LT EQ True == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4099 -> 4317[label="",style="solid", color="black", weight=3];
4100[label="(++) range40 LT (not (compare1 LT GT True == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4100 -> 4318[label="",style="solid", color="black", weight=3];
4101[label="[] ++ foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];4101 -> 4319[label="",style="solid", color="black", weight=3];
4102[label="(++) [] foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];4102 -> 4320[label="",style="solid", color="black", weight=3];
4103[label="(++) range00 False (not False) foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];4103 -> 4321[label="",style="solid", color="black", weight=3];
4104[label="(++) range00 False (not (compare1 False True True == LT)) foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];4104 -> 4322[label="",style="solid", color="black", weight=3];
9162[label="zx64000",fontsize=16,color="green",shape="box"];9163[label="zx64000",fontsize=16,color="green",shape="box"];9164[label="zx67000",fontsize=16,color="green",shape="box"];9165[label="zx67000",fontsize=16,color="green",shape="box"];9161[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat zx654 zx655 == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="burlywood",shape="triangle"];11807[label="zx654/Succ zx6540",fontsize=10,color="white",style="solid",shape="box"];9161 -> 11807[label="",style="solid", color="burlywood", weight=9];
11807 -> 9202[label="",style="solid", color="burlywood", weight=3];
11808[label="zx654/Zero",fontsize=10,color="white",style="solid",shape="box"];9161 -> 11808[label="",style="solid", color="burlywood", weight=9];
11808 -> 9203[label="",style="solid", color="burlywood", weight=3];
4107[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) (not True && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];4107 -> 4327[label="",style="solid", color="black", weight=3];
4108[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) False",fontsize=16,color="black",shape="box"];4108 -> 4328[label="",style="solid", color="black", weight=3];
4109[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not False && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];4109 -> 4329[label="",style="solid", color="black", weight=3];
4110[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (True && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];4110 -> 4330[label="",style="solid", color="black", weight=3];
4111[label="index5 (Integer (Pos Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (False && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];4111 -> 4331[label="",style="solid", color="black", weight=3];
4112[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (True && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];4112 -> 4332[label="",style="solid", color="black", weight=3];
4113[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (Integer (Pos zx6700) <= Integer (Pos zx6700))",fontsize=16,color="black",shape="box"];4113 -> 4333[label="",style="solid", color="black", weight=3];
9211[label="zx67000",fontsize=16,color="green",shape="box"];9212[label="zx64000",fontsize=16,color="green",shape="box"];9213[label="zx64000",fontsize=16,color="green",shape="box"];9214[label="zx67000",fontsize=16,color="green",shape="box"];9210[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat zx659 zx660 == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="burlywood",shape="triangle"];11809[label="zx659/Succ zx6590",fontsize=10,color="white",style="solid",shape="box"];9210 -> 11809[label="",style="solid", color="burlywood", weight=9];
11809 -> 9251[label="",style="solid", color="burlywood", weight=3];
11810[label="zx659/Zero",fontsize=10,color="white",style="solid",shape="box"];9210 -> 11810[label="",style="solid", color="burlywood", weight=9];
11810 -> 9252[label="",style="solid", color="burlywood", weight=3];
4116[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (not False && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];4116 -> 4338[label="",style="solid", color="black", weight=3];
4117[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (True && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];4117 -> 4339[label="",style="solid", color="black", weight=3];
4118[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (True && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];4118 -> 4340[label="",style="solid", color="black", weight=3];
4119[label="index5 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (not True && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];4119 -> 4341[label="",style="solid", color="black", weight=3];
4120[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (True && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];4120 -> 4342[label="",style="solid", color="black", weight=3];
8964[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat (Succ zx6280) (Succ zx6290) == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];8964 -> 9020[label="",style="solid", color="black", weight=3];
8965[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat (Succ zx6280) Zero == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];8965 -> 9021[label="",style="solid", color="black", weight=3];
8966[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat Zero (Succ zx6290) == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];8966 -> 9022[label="",style="solid", color="black", weight=3];
8967[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat Zero Zero == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];8967 -> 9023[label="",style="solid", color="black", weight=3];
4125[label="index12 (Pos (Succ zx6400)) (Pos Zero) (Pos Zero) False",fontsize=16,color="black",shape="box"];4125 -> 4348[label="",style="solid", color="black", weight=3];
4126[label="index11 (Pos (Succ zx6400)) (Neg zx670) (Neg zx670) True",fontsize=16,color="black",shape="box"];4126 -> 4349[label="",style="solid", color="black", weight=3];
4127[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (Pos (Succ zx6700) <= Pos (Succ zx6700))",fontsize=16,color="black",shape="box"];4127 -> 4350[label="",style="solid", color="black", weight=3];
4128[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (compare (Pos Zero) (Pos Zero) /= GT)",fontsize=16,color="black",shape="box"];4128 -> 4351[label="",style="solid", color="black", weight=3];
4129[label="index11 (Pos Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) otherwise",fontsize=16,color="black",shape="box"];4129 -> 4352[label="",style="solid", color="black", weight=3];
4130[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (compare (Neg Zero) (Neg Zero) /= GT)",fontsize=16,color="black",shape="box"];4130 -> 4353[label="",style="solid", color="black", weight=3];
4131[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (not (compare (Pos zx670) (Pos zx670) == GT))",fontsize=16,color="black",shape="box"];4131 -> 4354[label="",style="solid", color="black", weight=3];
9016[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat (Succ zx6330) (Succ zx6340) == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9016 -> 9026[label="",style="solid", color="black", weight=3];
9017[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat (Succ zx6330) Zero == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9017 -> 9027[label="",style="solid", color="black", weight=3];
9018[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat Zero (Succ zx6340) == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9018 -> 9028[label="",style="solid", color="black", weight=3];
9019[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat Zero Zero == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9019 -> 9029[label="",style="solid", color="black", weight=3];
4136[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (Neg Zero <= Neg Zero)",fontsize=16,color="black",shape="box"];4136 -> 4360[label="",style="solid", color="black", weight=3];
4137[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (compare (Pos (Succ zx6700)) (Pos (Succ zx6700)) /= GT)",fontsize=16,color="black",shape="box"];4137 -> 4361[label="",style="solid", color="black", weight=3];
4138[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (compare (Pos Zero) (Pos Zero) /= GT)",fontsize=16,color="black",shape="box"];4138 -> 4362[label="",style="solid", color="black", weight=3];
4139[label="index12 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) False",fontsize=16,color="black",shape="box"];4139 -> 4363[label="",style="solid", color="black", weight=3];
4140[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (compare (Neg Zero) (Neg Zero) /= GT)",fontsize=16,color="black",shape="box"];4140 -> 4364[label="",style="solid", color="black", weight=3];
4141[label="index3 LT zx64 (not (compare2 LT zx64 (LT == zx64) == LT))",fontsize=16,color="burlywood",shape="box"];11811[label="zx64/LT",fontsize=10,color="white",style="solid",shape="box"];4141 -> 11811[label="",style="solid", color="burlywood", weight=9];
11811 -> 4365[label="",style="solid", color="burlywood", weight=3];
11812[label="zx64/EQ",fontsize=10,color="white",style="solid",shape="box"];4141 -> 11812[label="",style="solid", color="burlywood", weight=9];
11812 -> 4366[label="",style="solid", color="burlywood", weight=3];
11813[label="zx64/GT",fontsize=10,color="white",style="solid",shape="box"];4141 -> 11813[label="",style="solid", color="burlywood", weight=9];
11813 -> 4367[label="",style="solid", color="burlywood", weight=3];
4142[label="index3 EQ zx64 (not (compare2 EQ zx64 (EQ == zx64) == LT))",fontsize=16,color="burlywood",shape="box"];11814[label="zx64/LT",fontsize=10,color="white",style="solid",shape="box"];4142 -> 11814[label="",style="solid", color="burlywood", weight=9];
11814 -> 4368[label="",style="solid", color="burlywood", weight=3];
11815[label="zx64/EQ",fontsize=10,color="white",style="solid",shape="box"];4142 -> 11815[label="",style="solid", color="burlywood", weight=9];
11815 -> 4369[label="",style="solid", color="burlywood", weight=3];
11816[label="zx64/GT",fontsize=10,color="white",style="solid",shape="box"];4142 -> 11816[label="",style="solid", color="burlywood", weight=9];
11816 -> 4370[label="",style="solid", color="burlywood", weight=3];
4143[label="index3 GT zx64 (not (compare2 GT zx64 (GT == zx64) == LT))",fontsize=16,color="burlywood",shape="box"];11817[label="zx64/LT",fontsize=10,color="white",style="solid",shape="box"];4143 -> 11817[label="",style="solid", color="burlywood", weight=9];
11817 -> 4371[label="",style="solid", color="burlywood", weight=3];
11818[label="zx64/EQ",fontsize=10,color="white",style="solid",shape="box"];4143 -> 11818[label="",style="solid", color="burlywood", weight=9];
11818 -> 4372[label="",style="solid", color="burlywood", weight=3];
11819[label="zx64/GT",fontsize=10,color="white",style="solid",shape="box"];4143 -> 11819[label="",style="solid", color="burlywood", weight=9];
11819 -> 4373[label="",style="solid", color="burlywood", weight=3];
4144[label="index2 False zx64 (not (compare2 False zx64 (False == zx64) == LT))",fontsize=16,color="burlywood",shape="box"];11820[label="zx64/False",fontsize=10,color="white",style="solid",shape="box"];4144 -> 11820[label="",style="solid", color="burlywood", weight=9];
11820 -> 4374[label="",style="solid", color="burlywood", weight=3];
11821[label="zx64/True",fontsize=10,color="white",style="solid",shape="box"];4144 -> 11821[label="",style="solid", color="burlywood", weight=9];
11821 -> 4375[label="",style="solid", color="burlywood", weight=3];
4145[label="index2 True zx64 (not (compare2 True zx64 (True == zx64) == LT))",fontsize=16,color="burlywood",shape="box"];11822[label="zx64/False",fontsize=10,color="white",style="solid",shape="box"];4145 -> 11822[label="",style="solid", color="burlywood", weight=9];
11822 -> 4376[label="",style="solid", color="burlywood", weight=3];
11823[label="zx64/True",fontsize=10,color="white",style="solid",shape="box"];4145 -> 11823[label="",style="solid", color="burlywood", weight=9];
11823 -> 4377[label="",style="solid", color="burlywood", weight=3];
3916[label="Succ (primPlusNat zx2410 zx15300)",fontsize=16,color="green",shape="box"];3916 -> 4378[label="",style="dashed", color="green", weight=3];
3917[label="Succ zx1510",fontsize=16,color="green",shape="box"];3918[label="zx15300",fontsize=16,color="green",shape="box"];3919[label="Succ zx1510",fontsize=16,color="green",shape="box"];4146[label="Succ (Succ (primPlusNat zx2430 zx15300))",fontsize=16,color="green",shape="box"];4146 -> 4379[label="",style="dashed", color="green", weight=3];
4147[label="Zero",fontsize=16,color="green",shape="box"];4148[label="Succ zx15300",fontsize=16,color="green",shape="box"];4149[label="Zero",fontsize=16,color="green",shape="box"];4150 -> 4010[label="",style="dashed", color="red", weight=0];
4150[label="primPlusNat zx2320 zx15300",fontsize=16,color="magenta"];4150 -> 4380[label="",style="dashed", color="magenta", weight=3];
4151[label="zx1580",fontsize=16,color="green",shape="box"];4152 -> 4010[label="",style="dashed", color="red", weight=0];
4152[label="primPlusNat zx2130 zx16000",fontsize=16,color="magenta"];4152 -> 4381[label="",style="dashed", color="magenta", weight=3];
4152 -> 4382[label="",style="dashed", color="magenta", weight=3];
4153 -> 4010[label="",style="dashed", color="red", weight=0];
4153[label="primPlusNat zx2130 zx16000",fontsize=16,color="magenta"];4153 -> 4383[label="",style="dashed", color="magenta", weight=3];
4153 -> 4384[label="",style="dashed", color="magenta", weight=3];
4154[label="primMinusNat (Succ zx160000) zx1580",fontsize=16,color="burlywood",shape="box"];11827[label="zx1580/Succ zx15800",fontsize=10,color="white",style="solid",shape="box"];4154 -> 11827[label="",style="solid", color="burlywood", weight=9];
11827 -> 4385[label="",style="solid", color="burlywood", weight=3];
11828[label="zx1580/Zero",fontsize=10,color="white",style="solid",shape="box"];4154 -> 11828[label="",style="solid", color="burlywood", weight=9];
11828 -> 4386[label="",style="solid", color="burlywood", weight=3];
4155[label="primMinusNat Zero zx1580",fontsize=16,color="burlywood",shape="box"];11829[label="zx1580/Succ zx15800",fontsize=10,color="white",style="solid",shape="box"];4155 -> 11829[label="",style="solid", color="burlywood", weight=9];
11829 -> 4387[label="",style="solid", color="burlywood", weight=3];
11830[label="zx1580/Zero",fontsize=10,color="white",style="solid",shape="box"];4155 -> 11830[label="",style="solid", color="burlywood", weight=9];
11830 -> 4388[label="",style="solid", color="burlywood", weight=3];
4255[label="zx129000",fontsize=16,color="green",shape="box"];4256[label="zx176000",fontsize=16,color="green",shape="box"];4257[label="primMinusInt (Pos zx2380) zx237",fontsize=16,color="burlywood",shape="box"];11831[label="zx237/Pos zx2370",fontsize=10,color="white",style="solid",shape="box"];4257 -> 11831[label="",style="solid", color="burlywood", weight=9];
11831 -> 4458[label="",style="solid", color="burlywood", weight=3];
11832[label="zx237/Neg zx2370",fontsize=10,color="white",style="solid",shape="box"];4257 -> 11832[label="",style="solid", color="burlywood", weight=9];
11832 -> 4459[label="",style="solid", color="burlywood", weight=3];
4258[label="primMinusInt (Neg zx2380) zx237",fontsize=16,color="burlywood",shape="box"];11833[label="zx237/Pos zx2370",fontsize=10,color="white",style="solid",shape="box"];4258 -> 11833[label="",style="solid", color="burlywood", weight=9];
11833 -> 4460[label="",style="solid", color="burlywood", weight=3];
11834[label="zx237/Neg zx2370",fontsize=10,color="white",style="solid",shape="box"];4258 -> 11834[label="",style="solid", color="burlywood", weight=9];
11834 -> 4461[label="",style="solid", color="burlywood", weight=3];
4269[label="rangeSize1 EQ LT (null ((++) range40 EQ (not (compare2 LT EQ (LT == EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4269 -> 4470[label="",style="solid", color="black", weight=3];
4270[label="rangeSize1 GT LT (null ((++) range40 EQ (not (compare2 LT EQ (LT == EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4270 -> 4471[label="",style="solid", color="black", weight=3];
4271 -> 1667[label="",style="dashed", color="red", weight=0];
4271[label="index (LT,EQ) EQ",fontsize=16,color="magenta"];4271 -> 4472[label="",style="dashed", color="magenta", weight=3];
4271 -> 4473[label="",style="dashed", color="magenta", weight=3];
4272[label="rangeSize1 EQ EQ (null ((++) range40 EQ (EQ >= EQ && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4272 -> 4474[label="",style="solid", color="black", weight=3];
5392[label="foldr (++) [] (range4 EQ GT EQ : map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];5392 -> 5656[label="",style="solid", color="black", weight=3];
4274 -> 1667[label="",style="dashed", color="red", weight=0];
4274[label="index (LT,GT) GT",fontsize=16,color="magenta"];4274 -> 4476[label="",style="dashed", color="magenta", weight=3];
4274 -> 4477[label="",style="dashed", color="magenta", weight=3];
4275[label="rangeSize1 EQ GT (null ((++) range40 EQ (GT >= EQ && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4275 -> 4478[label="",style="solid", color="black", weight=3];
4276[label="rangeSize1 GT GT (null ((++) range40 EQ (GT >= EQ && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4276 -> 4479[label="",style="solid", color="black", weight=3];
4277[label="rangeSize1 True False (null ((++) range00 True (not (compare2 False True (False == True) == LT) && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];4277 -> 4480[label="",style="solid", color="black", weight=3];
4278 -> 1668[label="",style="dashed", color="red", weight=0];
4278[label="index (False,True) True",fontsize=16,color="magenta"];4278 -> 4481[label="",style="dashed", color="magenta", weight=3];
4278 -> 4482[label="",style="dashed", color="magenta", weight=3];
4279[label="rangeSize1 True True (null ((++) range00 True (True >= True && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];4279 -> 4483[label="",style="solid", color="black", weight=3];
7664 -> 7673[label="",style="dashed", color="red", weight=0];
7664[label="takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (enforceWHNF (WHNF (Integer (primPlusInt (Neg (Succ zx488)) (Pos (Succ Zero))))) (numericEnumFrom (Integer (primPlusInt (Neg (Succ zx488)) (Pos (Succ Zero))))))",fontsize=16,color="magenta"];7664 -> 7674[label="",style="dashed", color="magenta", weight=3];
7664 -> 7675[label="",style="dashed", color="magenta", weight=3];
4310[label="foldr (++) [] (map (range4 LT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4310 -> 4513[label="",style="solid", color="black", weight=3];
4311[label="foldr (++) [] (map (range4 LT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4311 -> 4514[label="",style="solid", color="black", weight=3];
4312[label="foldr (++) [] (map (range4 LT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4312 -> 4515[label="",style="solid", color="black", weight=3];
4313[label="(++) range40 LT True foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4313 -> 4516[label="",style="solid", color="black", weight=3];
4314[label="(++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4314 -> 4517[label="",style="solid", color="black", weight=3];
4316[label="(++) range40 LT True foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4316 -> 4519[label="",style="solid", color="black", weight=3];
4317[label="(++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4317 -> 4520[label="",style="solid", color="black", weight=3];
4318[label="(++) range40 LT (not (LT == LT)) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4318 -> 4521[label="",style="solid", color="black", weight=3];
4319[label="foldr (++) [] (map (range0 False False) (True : []))",fontsize=16,color="black",shape="box"];4319 -> 4522[label="",style="solid", color="black", weight=3];
4320[label="foldr (++) [] (map (range0 False True) (True : []))",fontsize=16,color="black",shape="box"];4320 -> 4523[label="",style="solid", color="black", weight=3];
4321[label="(++) range00 False True foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];4321 -> 4524[label="",style="solid", color="black", weight=3];
4322[label="(++) range00 False (not (LT == LT)) foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];4322 -> 4525[label="",style="solid", color="black", weight=3];
9202[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat (Succ zx6540) zx655 == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="burlywood",shape="box"];11839[label="zx655/Succ zx6550",fontsize=10,color="white",style="solid",shape="box"];9202 -> 11839[label="",style="solid", color="burlywood", weight=9];
11839 -> 9253[label="",style="solid", color="burlywood", weight=3];
11840[label="zx655/Zero",fontsize=10,color="white",style="solid",shape="box"];9202 -> 11840[label="",style="solid", color="burlywood", weight=9];
11840 -> 9254[label="",style="solid", color="burlywood", weight=3];
9203[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat Zero zx655 == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="burlywood",shape="box"];11841[label="zx655/Succ zx6550",fontsize=10,color="white",style="solid",shape="box"];9203 -> 11841[label="",style="solid", color="burlywood", weight=9];
11841 -> 9255[label="",style="solid", color="burlywood", weight=3];
11842[label="zx655/Zero",fontsize=10,color="white",style="solid",shape="box"];9203 -> 11842[label="",style="solid", color="burlywood", weight=9];
11842 -> 9256[label="",style="solid", color="burlywood", weight=3];
4327[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) (False && Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];4327 -> 4530[label="",style="solid", color="black", weight=3];
4328[label="index4 (Integer (Pos (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) otherwise",fontsize=16,color="black",shape="box"];4328 -> 4531[label="",style="solid", color="black", weight=3];
4329[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (True && Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];4329 -> 4532[label="",style="solid", color="black", weight=3];
4330[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];4330 -> 4533[label="",style="solid", color="black", weight=3];
4331[label="index5 (Integer (Pos Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) False",fontsize=16,color="black",shape="box"];4331 -> 4534[label="",style="solid", color="black", weight=3];
4332[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];4332 -> 4535[label="",style="solid", color="black", weight=3];
4333[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (compare (Integer (Pos zx6700)) (Integer (Pos zx6700)) /= GT)",fontsize=16,color="black",shape="box"];4333 -> 4536[label="",style="solid", color="black", weight=3];
9251[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat (Succ zx6590) zx660 == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="burlywood",shape="box"];11843[label="zx660/Succ zx6600",fontsize=10,color="white",style="solid",shape="box"];9251 -> 11843[label="",style="solid", color="burlywood", weight=9];
11843 -> 9307[label="",style="solid", color="burlywood", weight=3];
11844[label="zx660/Zero",fontsize=10,color="white",style="solid",shape="box"];9251 -> 11844[label="",style="solid", color="burlywood", weight=9];
11844 -> 9308[label="",style="solid", color="burlywood", weight=3];
9252[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat Zero zx660 == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="burlywood",shape="box"];11845[label="zx660/Succ zx6600",fontsize=10,color="white",style="solid",shape="box"];9252 -> 11845[label="",style="solid", color="burlywood", weight=9];
11845 -> 9309[label="",style="solid", color="burlywood", weight=3];
11846[label="zx660/Zero",fontsize=10,color="white",style="solid",shape="box"];9252 -> 11846[label="",style="solid", color="burlywood", weight=9];
11846 -> 9310[label="",style="solid", color="burlywood", weight=3];
4338[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (True && Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];4338 -> 4541[label="",style="solid", color="black", weight=3];
4339[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];4339 -> 4542[label="",style="solid", color="black", weight=3];
4340[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero) <= Integer (Pos Zero))",fontsize=16,color="black",shape="box"];4340 -> 4543[label="",style="solid", color="black", weight=3];
4341[label="index5 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) (False && Integer (Neg (Succ zx67000)) <= Integer (Neg (Succ zx67000)))",fontsize=16,color="black",shape="box"];4341 -> 4544[label="",style="solid", color="black", weight=3];
4342[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];4342 -> 4545[label="",style="solid", color="black", weight=3];
9020 -> 8876[label="",style="dashed", color="red", weight=0];
9020[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat zx6280 zx6290 == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="magenta"];9020 -> 9030[label="",style="dashed", color="magenta", weight=3];
9020 -> 9031[label="",style="dashed", color="magenta", weight=3];
9021[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (GT == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];9021 -> 9032[label="",style="solid", color="black", weight=3];
9022[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (LT == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];9022 -> 9033[label="",style="solid", color="black", weight=3];
9023[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (EQ == GT) && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];9023 -> 9034[label="",style="solid", color="black", weight=3];
4348[label="index11 (Pos (Succ zx6400)) (Pos Zero) (Pos Zero) otherwise",fontsize=16,color="black",shape="box"];4348 -> 4553[label="",style="solid", color="black", weight=3];
4349 -> 2397[label="",style="dashed", color="red", weight=0];
4349[label="error []",fontsize=16,color="magenta"];4350[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (compare (Pos (Succ zx6700)) (Pos (Succ zx6700)) /= GT)",fontsize=16,color="black",shape="box"];4350 -> 4554[label="",style="solid", color="black", weight=3];
4351[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (not (compare (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];4351 -> 4555[label="",style="solid", color="black", weight=3];
4352[label="index11 (Pos Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) True",fontsize=16,color="black",shape="box"];4352 -> 4556[label="",style="solid", color="black", weight=3];
4353[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (not (compare (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];4353 -> 4557[label="",style="solid", color="black", weight=3];
4354[label="index12 (Neg (Succ zx6400)) (Pos zx670) (Pos zx670) (not (primCmpInt (Pos zx670) (Pos zx670) == GT))",fontsize=16,color="burlywood",shape="box"];11849[label="zx670/Succ zx6700",fontsize=10,color="white",style="solid",shape="box"];4354 -> 11849[label="",style="solid", color="burlywood", weight=9];
11849 -> 4558[label="",style="solid", color="burlywood", weight=3];
11850[label="zx670/Zero",fontsize=10,color="white",style="solid",shape="box"];4354 -> 11850[label="",style="solid", color="burlywood", weight=9];
11850 -> 4559[label="",style="solid", color="burlywood", weight=3];
9026 -> 8921[label="",style="dashed", color="red", weight=0];
9026[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat zx6330 zx6340 == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="magenta"];9026 -> 9037[label="",style="dashed", color="magenta", weight=3];
9026 -> 9038[label="",style="dashed", color="magenta", weight=3];
9027[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (GT == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9027 -> 9039[label="",style="solid", color="black", weight=3];
9028[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (LT == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9028 -> 9040[label="",style="solid", color="black", weight=3];
9029[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (EQ == GT) && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9029 -> 9041[label="",style="solid", color="black", weight=3];
4360[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (compare (Neg Zero) (Neg Zero) /= GT)",fontsize=16,color="black",shape="box"];4360 -> 4567[label="",style="solid", color="black", weight=3];
4361[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (compare (Pos (Succ zx6700)) (Pos (Succ zx6700)) == GT))",fontsize=16,color="black",shape="box"];4361 -> 4568[label="",style="solid", color="black", weight=3];
4362[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (not (compare (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];4362 -> 4569[label="",style="solid", color="black", weight=3];
4363[label="index11 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) otherwise",fontsize=16,color="black",shape="box"];4363 -> 4570[label="",style="solid", color="black", weight=3];
4364[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (not (compare (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];4364 -> 4571[label="",style="solid", color="black", weight=3];
4365[label="index3 LT LT (not (compare2 LT LT (LT == LT) == LT))",fontsize=16,color="black",shape="box"];4365 -> 4572[label="",style="solid", color="black", weight=3];
4366[label="index3 LT EQ (not (compare2 LT EQ (LT == EQ) == LT))",fontsize=16,color="black",shape="box"];4366 -> 4573[label="",style="solid", color="black", weight=3];
4367[label="index3 LT GT (not (compare2 LT GT (LT == GT) == LT))",fontsize=16,color="black",shape="box"];4367 -> 4574[label="",style="solid", color="black", weight=3];
4368[label="index3 EQ LT (not (compare2 EQ LT (EQ == LT) == LT))",fontsize=16,color="black",shape="box"];4368 -> 4575[label="",style="solid", color="black", weight=3];
4369[label="index3 EQ EQ (not (compare2 EQ EQ (EQ == EQ) == LT))",fontsize=16,color="black",shape="box"];4369 -> 4576[label="",style="solid", color="black", weight=3];
4370[label="index3 EQ GT (not (compare2 EQ GT (EQ == GT) == LT))",fontsize=16,color="black",shape="box"];4370 -> 4577[label="",style="solid", color="black", weight=3];
4371[label="index3 GT LT (not (compare2 GT LT (GT == LT) == LT))",fontsize=16,color="black",shape="box"];4371 -> 4578[label="",style="solid", color="black", weight=3];
4372[label="index3 GT EQ (not (compare2 GT EQ (GT == EQ) == LT))",fontsize=16,color="black",shape="box"];4372 -> 4579[label="",style="solid", color="black", weight=3];
4373[label="index3 GT GT (not (compare2 GT GT (GT == GT) == LT))",fontsize=16,color="black",shape="box"];4373 -> 4580[label="",style="solid", color="black", weight=3];
4374[label="index2 False False (not (compare2 False False (False == False) == LT))",fontsize=16,color="black",shape="box"];4374 -> 4581[label="",style="solid", color="black", weight=3];
4375[label="index2 False True (not (compare2 False True (False == True) == LT))",fontsize=16,color="black",shape="box"];4375 -> 4582[label="",style="solid", color="black", weight=3];
4376[label="index2 True False (not (compare2 True False (True == False) == LT))",fontsize=16,color="black",shape="box"];4376 -> 4583[label="",style="solid", color="black", weight=3];
4377[label="index2 True True (not (compare2 True True (True == True) == LT))",fontsize=16,color="black",shape="box"];4377 -> 4584[label="",style="solid", color="black", weight=3];
4378 -> 4010[label="",style="dashed", color="red", weight=0];
4378[label="primPlusNat zx2410 zx15300",fontsize=16,color="magenta"];4378 -> 4585[label="",style="dashed", color="magenta", weight=3];
4378 -> 4586[label="",style="dashed", color="magenta", weight=3];
4379 -> 4010[label="",style="dashed", color="red", weight=0];
4379[label="primPlusNat zx2430 zx15300",fontsize=16,color="magenta"];4379 -> 4587[label="",style="dashed", color="magenta", weight=3];
4379 -> 4588[label="",style="dashed", color="magenta", weight=3];
4380[label="zx2320",fontsize=16,color="green",shape="box"];4381[label="zx16000",fontsize=16,color="green",shape="box"];4382[label="zx2130",fontsize=16,color="green",shape="box"];4383[label="zx16000",fontsize=16,color="green",shape="box"];4384[label="zx2130",fontsize=16,color="green",shape="box"];4385[label="primMinusNat (Succ zx160000) (Succ zx15800)",fontsize=16,color="black",shape="box"];4385 -> 4589[label="",style="solid", color="black", weight=3];
4386[label="primMinusNat (Succ zx160000) Zero",fontsize=16,color="black",shape="box"];4386 -> 4590[label="",style="solid", color="black", weight=3];
4387[label="primMinusNat Zero (Succ zx15800)",fontsize=16,color="black",shape="box"];4387 -> 4591[label="",style="solid", color="black", weight=3];
4388[label="primMinusNat Zero Zero",fontsize=16,color="black",shape="box"];4388 -> 4592[label="",style="solid", color="black", weight=3];
4458[label="primMinusInt (Pos zx2380) (Pos zx2370)",fontsize=16,color="black",shape="box"];4458 -> 4629[label="",style="solid", color="black", weight=3];
4459[label="primMinusInt (Pos zx2380) (Neg zx2370)",fontsize=16,color="black",shape="box"];4459 -> 4630[label="",style="solid", color="black", weight=3];
4460[label="primMinusInt (Neg zx2380) (Pos zx2370)",fontsize=16,color="black",shape="box"];4460 -> 4631[label="",style="solid", color="black", weight=3];
4461[label="primMinusInt (Neg zx2380) (Neg zx2370)",fontsize=16,color="black",shape="box"];4461 -> 4632[label="",style="solid", color="black", weight=3];
4470[label="rangeSize1 EQ LT (null ((++) range40 EQ (not (compare2 LT EQ False == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4470 -> 4795[label="",style="solid", color="black", weight=3];
4471[label="rangeSize1 GT LT (null ((++) range40 EQ (not (compare2 LT EQ False == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4471 -> 4796[label="",style="solid", color="black", weight=3];
4472[label="LT",fontsize=16,color="green",shape="box"];4473[label="EQ",fontsize=16,color="green",shape="box"];4474[label="rangeSize1 EQ EQ (null ((++) range40 EQ (compare EQ EQ /= LT && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4474 -> 4797[label="",style="solid", color="black", weight=3];
5656[label="(++) range4 EQ GT EQ foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];5656 -> 6135[label="",style="solid", color="black", weight=3];
4476[label="LT",fontsize=16,color="green",shape="box"];4477[label="GT",fontsize=16,color="green",shape="box"];4478[label="rangeSize1 EQ GT (null ((++) range40 EQ (compare GT EQ /= LT && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4478 -> 4799[label="",style="solid", color="black", weight=3];
4479[label="rangeSize1 GT GT (null ((++) range40 EQ (compare GT EQ /= LT && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4479 -> 4800[label="",style="solid", color="black", weight=3];
4480[label="rangeSize1 True False (null ((++) range00 True (not (compare2 False True False == LT) && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];4480 -> 4801[label="",style="solid", color="black", weight=3];
4481[label="False",fontsize=16,color="green",shape="box"];4482[label="True",fontsize=16,color="green",shape="box"];4483[label="rangeSize1 True True (null ((++) range00 True (compare True True /= LT && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];4483 -> 4802[label="",style="solid", color="black", weight=3];
7674 -> 1395[label="",style="dashed", color="red", weight=0];
7674[label="primPlusInt (Neg (Succ zx488)) (Pos (Succ Zero))",fontsize=16,color="magenta"];7674 -> 7676[label="",style="dashed", color="magenta", weight=3];
7675 -> 1395[label="",style="dashed", color="red", weight=0];
7675[label="primPlusInt (Neg (Succ zx488)) (Pos (Succ Zero))",fontsize=16,color="magenta"];7675 -> 7677[label="",style="dashed", color="magenta", weight=3];
7673[label="takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (enforceWHNF (WHNF (Integer zx520)) (numericEnumFrom (Integer zx519)))",fontsize=16,color="black",shape="triangle"];7673 -> 7678[label="",style="solid", color="black", weight=3];
4513[label="foldr (++) [] (range4 LT LT EQ : map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];4513 -> 4829[label="",style="solid", color="black", weight=3];
4514[label="foldr (++) [] (range4 LT EQ EQ : map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];4514 -> 4830[label="",style="solid", color="black", weight=3];
4515[label="foldr (++) [] (range4 LT GT EQ : map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];4515 -> 4831[label="",style="solid", color="black", weight=3];
4516[label="(++) (LT : []) foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4516 -> 4832[label="",style="solid", color="black", weight=3];
4517[label="(++) range40 LT (not True) foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4517 -> 4833[label="",style="solid", color="black", weight=3];
4519[label="(++) (LT : []) foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4519 -> 4835[label="",style="solid", color="black", weight=3];
4520[label="(++) range40 LT (not True) foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4520 -> 4836[label="",style="solid", color="black", weight=3];
4521[label="(++) range40 LT (not True) foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4521 -> 4837[label="",style="solid", color="black", weight=3];
4522[label="foldr (++) [] (range0 False False True : map (range0 False False) [])",fontsize=16,color="black",shape="box"];4522 -> 4838[label="",style="solid", color="black", weight=3];
4523[label="foldr (++) [] (range0 False True True : map (range0 False True) [])",fontsize=16,color="black",shape="box"];4523 -> 4839[label="",style="solid", color="black", weight=3];
4524[label="(++) (False : []) foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];4524 -> 4840[label="",style="solid", color="black", weight=3];
4525[label="(++) range00 False (not True) foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];4525 -> 4841[label="",style="solid", color="black", weight=3];
9253[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat (Succ zx6540) (Succ zx6550) == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9253 -> 9311[label="",style="solid", color="black", weight=3];
9254[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat (Succ zx6540) Zero == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9254 -> 9312[label="",style="solid", color="black", weight=3];
9255[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat Zero (Succ zx6550) == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9255 -> 9313[label="",style="solid", color="black", weight=3];
9256[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat Zero Zero == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9256 -> 9314[label="",style="solid", color="black", weight=3];
4530[label="index5 (Integer (Pos (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) False",fontsize=16,color="black",shape="box"];4530 -> 4847[label="",style="solid", color="black", weight=3];
4531[label="index4 (Integer (Pos (Succ zx64000))) (Integer (Neg zx6700)) (Integer (Neg zx6700)) True",fontsize=16,color="black",shape="box"];4531 -> 4848[label="",style="solid", color="black", weight=3];
4532[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000)) <= Integer (Pos (Succ zx67000)))",fontsize=16,color="black",shape="box"];4532 -> 4849[label="",style="solid", color="black", weight=3];
4533[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (compare (Integer (Pos Zero)) (Integer (Pos Zero)) /= GT)",fontsize=16,color="black",shape="box"];4533 -> 4850[label="",style="solid", color="black", weight=3];
4534[label="index4 (Integer (Pos Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) otherwise",fontsize=16,color="black",shape="box"];4534 -> 4851[label="",style="solid", color="black", weight=3];
4535[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (compare (Integer (Neg Zero)) (Integer (Neg Zero)) /= GT)",fontsize=16,color="black",shape="box"];4535 -> 4852[label="",style="solid", color="black", weight=3];
4536[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (compare (Integer (Pos zx6700)) (Integer (Pos zx6700)) == GT))",fontsize=16,color="black",shape="box"];4536 -> 4853[label="",style="solid", color="black", weight=3];
9307[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat (Succ zx6590) (Succ zx6600) == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9307 -> 9358[label="",style="solid", color="black", weight=3];
9308[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat (Succ zx6590) Zero == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9308 -> 9359[label="",style="solid", color="black", weight=3];
9309[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat Zero (Succ zx6600) == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9309 -> 9360[label="",style="solid", color="black", weight=3];
9310[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat Zero Zero == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9310 -> 9361[label="",style="solid", color="black", weight=3];
4541[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero) <= Integer (Neg Zero))",fontsize=16,color="black",shape="box"];4541 -> 4859[label="",style="solid", color="black", weight=3];
4542[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (compare (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) /= GT)",fontsize=16,color="black",shape="box"];4542 -> 4860[label="",style="solid", color="black", weight=3];
4543[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (compare (Integer (Pos Zero)) (Integer (Pos Zero)) /= GT)",fontsize=16,color="black",shape="box"];4543 -> 4861[label="",style="solid", color="black", weight=3];
4544[label="index5 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) False",fontsize=16,color="black",shape="box"];4544 -> 4862[label="",style="solid", color="black", weight=3];
4545[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (compare (Integer (Neg Zero)) (Integer (Neg Zero)) /= GT)",fontsize=16,color="black",shape="box"];4545 -> 4863[label="",style="solid", color="black", weight=3];
9030[label="zx6290",fontsize=16,color="green",shape="box"];9031[label="zx6280",fontsize=16,color="green",shape="box"];9032[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not True && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];9032 -> 9042[label="",style="solid", color="black", weight=3];
9033[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not False && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="triangle"];9033 -> 9043[label="",style="solid", color="black", weight=3];
9034 -> 9033[label="",style="dashed", color="red", weight=0];
9034[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not False && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="magenta"];4553[label="index11 (Pos (Succ zx6400)) (Pos Zero) (Pos Zero) True",fontsize=16,color="black",shape="box"];4553 -> 4871[label="",style="solid", color="black", weight=3];
4554[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (compare (Pos (Succ zx6700)) (Pos (Succ zx6700)) == GT))",fontsize=16,color="black",shape="box"];4554 -> 4872[label="",style="solid", color="black", weight=3];
4555[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];4555 -> 4873[label="",style="solid", color="black", weight=3];
4556 -> 2397[label="",style="dashed", color="red", weight=0];
4556[label="error []",fontsize=16,color="magenta"];4557[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];4557 -> 4874[label="",style="solid", color="black", weight=3];
4558[label="index12 (Neg (Succ zx6400)) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpInt (Pos (Succ zx6700)) (Pos (Succ zx6700)) == GT))",fontsize=16,color="black",shape="box"];4558 -> 4875[label="",style="solid", color="black", weight=3];
4559[label="index12 (Neg (Succ zx6400)) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];4559 -> 4876[label="",style="solid", color="black", weight=3];
9037[label="zx6330",fontsize=16,color="green",shape="box"];9038[label="zx6340",fontsize=16,color="green",shape="box"];9039[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not True && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9039 -> 9052[label="",style="solid", color="black", weight=3];
9040[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not False && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="triangle"];9040 -> 9053[label="",style="solid", color="black", weight=3];
9041 -> 9040[label="",style="dashed", color="red", weight=0];
9041[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not False && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="magenta"];4567[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (not (compare (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];4567 -> 4884[label="",style="solid", color="black", weight=3];
4568[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpInt (Pos (Succ zx6700)) (Pos (Succ zx6700)) == GT))",fontsize=16,color="black",shape="box"];4568 -> 4885[label="",style="solid", color="black", weight=3];
4569[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];4569 -> 4886[label="",style="solid", color="black", weight=3];
4570[label="index11 (Neg Zero) (Neg (Succ zx6700)) (Neg (Succ zx6700)) True",fontsize=16,color="black",shape="box"];4570 -> 4887[label="",style="solid", color="black", weight=3];
4571[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];4571 -> 4888[label="",style="solid", color="black", weight=3];
4572[label="index3 LT LT (not (compare2 LT LT True == LT))",fontsize=16,color="black",shape="box"];4572 -> 4889[label="",style="solid", color="black", weight=3];
4573[label="index3 LT EQ (not (compare2 LT EQ False == LT))",fontsize=16,color="black",shape="box"];4573 -> 4890[label="",style="solid", color="black", weight=3];
4574[label="index3 LT GT (not (compare2 LT GT False == LT))",fontsize=16,color="black",shape="box"];4574 -> 4891[label="",style="solid", color="black", weight=3];
4575[label="index3 EQ LT (not (compare2 EQ LT False == LT))",fontsize=16,color="black",shape="box"];4575 -> 4892[label="",style="solid", color="black", weight=3];
4576[label="index3 EQ EQ (not (compare2 EQ EQ True == LT))",fontsize=16,color="black",shape="box"];4576 -> 4893[label="",style="solid", color="black", weight=3];
4577[label="index3 EQ GT (not (compare2 EQ GT False == LT))",fontsize=16,color="black",shape="box"];4577 -> 4894[label="",style="solid", color="black", weight=3];
4578[label="index3 GT LT (not (compare2 GT LT False == LT))",fontsize=16,color="black",shape="box"];4578 -> 4895[label="",style="solid", color="black", weight=3];
4579[label="index3 GT EQ (not (compare2 GT EQ False == LT))",fontsize=16,color="black",shape="box"];4579 -> 4896[label="",style="solid", color="black", weight=3];
4580[label="index3 GT GT (not (compare2 GT GT True == LT))",fontsize=16,color="black",shape="box"];4580 -> 4897[label="",style="solid", color="black", weight=3];
4581[label="index2 False False (not (compare2 False False True == LT))",fontsize=16,color="black",shape="box"];4581 -> 4898[label="",style="solid", color="black", weight=3];
4582[label="index2 False True (not (compare2 False True False == LT))",fontsize=16,color="black",shape="box"];4582 -> 4899[label="",style="solid", color="black", weight=3];
4583[label="index2 True False (not (compare2 True False False == LT))",fontsize=16,color="black",shape="box"];4583 -> 4900[label="",style="solid", color="black", weight=3];
4584[label="index2 True True (not (compare2 True True True == LT))",fontsize=16,color="black",shape="box"];4584 -> 4901[label="",style="solid", color="black", weight=3];
4585[label="zx15300",fontsize=16,color="green",shape="box"];4586[label="zx2410",fontsize=16,color="green",shape="box"];4587[label="zx15300",fontsize=16,color="green",shape="box"];4588[label="zx2430",fontsize=16,color="green",shape="box"];4589 -> 3931[label="",style="dashed", color="red", weight=0];
4589[label="primMinusNat zx160000 zx15800",fontsize=16,color="magenta"];4589 -> 4902[label="",style="dashed", color="magenta", weight=3];
4589 -> 4903[label="",style="dashed", color="magenta", weight=3];
4590[label="Pos (Succ zx160000)",fontsize=16,color="green",shape="box"];4591[label="Neg (Succ zx15800)",fontsize=16,color="green",shape="box"];4592[label="Pos Zero",fontsize=16,color="green",shape="box"];4629 -> 3931[label="",style="dashed", color="red", weight=0];
4629[label="primMinusNat zx2380 zx2370",fontsize=16,color="magenta"];4629 -> 4969[label="",style="dashed", color="magenta", weight=3];
4629 -> 4970[label="",style="dashed", color="magenta", weight=3];
4630[label="Pos (primPlusNat zx2380 zx2370)",fontsize=16,color="green",shape="box"];4630 -> 4971[label="",style="dashed", color="green", weight=3];
4631[label="Neg (primPlusNat zx2380 zx2370)",fontsize=16,color="green",shape="box"];4631 -> 4972[label="",style="dashed", color="green", weight=3];
4632 -> 3931[label="",style="dashed", color="red", weight=0];
4632[label="primMinusNat zx2370 zx2380",fontsize=16,color="magenta"];4632 -> 4973[label="",style="dashed", color="magenta", weight=3];
4632 -> 4974[label="",style="dashed", color="magenta", weight=3];
4795[label="rangeSize1 EQ LT (null ((++) range40 EQ (not (compare1 LT EQ (LT <= EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4795 -> 4979[label="",style="solid", color="black", weight=3];
4796[label="rangeSize1 GT LT (null ((++) range40 EQ (not (compare1 LT EQ (LT <= EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4796 -> 4980[label="",style="solid", color="black", weight=3];
4797[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare EQ EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4797 -> 4981[label="",style="solid", color="black", weight=3];
6135[label="(++) range40 EQ (EQ >= EQ && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];6135 -> 6427[label="",style="solid", color="black", weight=3];
4799[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare GT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4799 -> 4983[label="",style="solid", color="black", weight=3];
4800[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare GT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4800 -> 4984[label="",style="solid", color="black", weight=3];
4801[label="rangeSize1 True False (null ((++) range00 True (not (compare1 False True (False <= True) == LT) && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];4801 -> 4985[label="",style="solid", color="black", weight=3];
4802[label="rangeSize1 True True (null ((++) range00 True (not (compare True True == LT) && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];4802 -> 4986[label="",style="solid", color="black", weight=3];
7676[label="Neg (Succ zx488)",fontsize=16,color="green",shape="box"];7677[label="Neg (Succ zx488)",fontsize=16,color="green",shape="box"];7678 -> 184[label="",style="dashed", color="red", weight=0];
7678[label="takeWhile (flip (<=) (Integer (Neg (Succ zx487)))) (numericEnumFrom (Integer zx519))",fontsize=16,color="magenta"];7678 -> 7700[label="",style="dashed", color="magenta", weight=3];
7678 -> 7701[label="",style="dashed", color="magenta", weight=3];
4829[label="(++) range4 LT LT EQ foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];4829 -> 5027[label="",style="solid", color="black", weight=3];
4830[label="(++) range4 LT EQ EQ foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];4830 -> 5028[label="",style="solid", color="black", weight=3];
4831[label="(++) range4 LT GT EQ foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];4831 -> 5029[label="",style="solid", color="black", weight=3];
4832[label="LT : [] ++ foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="green",shape="box"];4832 -> 5030[label="",style="dashed", color="green", weight=3];
4833[label="(++) range40 LT False foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4833 -> 5031[label="",style="solid", color="black", weight=3];
4835[label="LT : [] ++ foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="green",shape="box"];4835 -> 5033[label="",style="dashed", color="green", weight=3];
4836[label="(++) range40 LT False foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4836 -> 5034[label="",style="solid", color="black", weight=3];
4837[label="(++) range40 LT False foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];4837 -> 5035[label="",style="solid", color="black", weight=3];
4838[label="(++) range0 False False True foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];4838 -> 5036[label="",style="solid", color="black", weight=3];
4839[label="(++) range0 False True True foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];4839 -> 5037[label="",style="solid", color="black", weight=3];
4840[label="False : [] ++ foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="green",shape="box"];4840 -> 5038[label="",style="dashed", color="green", weight=3];
4841[label="(++) range00 False False foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];4841 -> 5039[label="",style="solid", color="black", weight=3];
9311 -> 9161[label="",style="dashed", color="red", weight=0];
9311[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat zx6540 zx6550 == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="magenta"];9311 -> 9362[label="",style="dashed", color="magenta", weight=3];
9311 -> 9363[label="",style="dashed", color="magenta", weight=3];
9312[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (GT == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9312 -> 9364[label="",style="solid", color="black", weight=3];
9313[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (LT == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9313 -> 9365[label="",style="solid", color="black", weight=3];
9314[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (EQ == GT) && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9314 -> 9366[label="",style="solid", color="black", weight=3];
4847[label="index4 (Integer (Pos (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) otherwise",fontsize=16,color="black",shape="box"];4847 -> 5047[label="",style="solid", color="black", weight=3];
4848 -> 2397[label="",style="dashed", color="red", weight=0];
4848[label="error []",fontsize=16,color="magenta"];4849[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (compare (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) /= GT)",fontsize=16,color="black",shape="box"];4849 -> 5048[label="",style="solid", color="black", weight=3];
4850[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (compare (Integer (Pos Zero)) (Integer (Pos Zero)) == GT))",fontsize=16,color="black",shape="box"];4850 -> 5049[label="",style="solid", color="black", weight=3];
4851[label="index4 (Integer (Pos Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) True",fontsize=16,color="black",shape="box"];4851 -> 5050[label="",style="solid", color="black", weight=3];
4852[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (compare (Integer (Neg Zero)) (Integer (Neg Zero)) == GT))",fontsize=16,color="black",shape="box"];4852 -> 5051[label="",style="solid", color="black", weight=3];
4853[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos zx6700)) (Integer (Pos zx6700)) (not (primCmpInt (Pos zx6700) (Pos zx6700) == GT))",fontsize=16,color="burlywood",shape="box"];11865[label="zx6700/Succ zx67000",fontsize=10,color="white",style="solid",shape="box"];4853 -> 11865[label="",style="solid", color="burlywood", weight=9];
11865 -> 5052[label="",style="solid", color="burlywood", weight=3];
11866[label="zx6700/Zero",fontsize=10,color="white",style="solid",shape="box"];4853 -> 11866[label="",style="solid", color="burlywood", weight=9];
11866 -> 5053[label="",style="solid", color="burlywood", weight=3];
9358 -> 9210[label="",style="dashed", color="red", weight=0];
9358[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat zx6590 zx6600 == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="magenta"];9358 -> 9372[label="",style="dashed", color="magenta", weight=3];
9358 -> 9373[label="",style="dashed", color="magenta", weight=3];
9359[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (GT == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9359 -> 9374[label="",style="solid", color="black", weight=3];
9360[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (LT == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9360 -> 9375[label="",style="solid", color="black", weight=3];
9361[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (EQ == GT) && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9361 -> 9376[label="",style="solid", color="black", weight=3];
4859[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (compare (Integer (Neg Zero)) (Integer (Neg Zero)) /= GT)",fontsize=16,color="black",shape="box"];4859 -> 5061[label="",style="solid", color="black", weight=3];
4860[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (compare (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) == GT))",fontsize=16,color="black",shape="box"];4860 -> 5062[label="",style="solid", color="black", weight=3];
4861[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (compare (Integer (Pos Zero)) (Integer (Pos Zero)) == GT))",fontsize=16,color="black",shape="box"];4861 -> 5063[label="",style="solid", color="black", weight=3];
4862[label="index4 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) otherwise",fontsize=16,color="black",shape="box"];4862 -> 5064[label="",style="solid", color="black", weight=3];
4863[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (compare (Integer (Neg Zero)) (Integer (Neg Zero)) == GT))",fontsize=16,color="black",shape="box"];4863 -> 5065[label="",style="solid", color="black", weight=3];
9042[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (False && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];9042 -> 9054[label="",style="solid", color="black", weight=3];
9043[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (True && Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];9043 -> 9055[label="",style="solid", color="black", weight=3];
4871 -> 2397[label="",style="dashed", color="red", weight=0];
4871[label="error []",fontsize=16,color="magenta"];4872[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpInt (Pos (Succ zx6700)) (Pos (Succ zx6700)) == GT))",fontsize=16,color="black",shape="box"];4872 -> 5074[label="",style="solid", color="black", weight=3];
4873[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (not (EQ == GT))",fontsize=16,color="black",shape="box"];4873 -> 5075[label="",style="solid", color="black", weight=3];
4874[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (not (EQ == GT))",fontsize=16,color="black",shape="box"];4874 -> 5076[label="",style="solid", color="black", weight=3];
4875 -> 7506[label="",style="dashed", color="red", weight=0];
4875[label="index12 (Neg (Succ zx6400)) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpNat (Succ zx6700) (Succ zx6700) == GT))",fontsize=16,color="magenta"];4875 -> 7507[label="",style="dashed", color="magenta", weight=3];
4875 -> 7508[label="",style="dashed", color="magenta", weight=3];
4875 -> 7509[label="",style="dashed", color="magenta", weight=3];
4876[label="index12 (Neg (Succ zx6400)) (Pos Zero) (Pos Zero) (not (EQ == GT))",fontsize=16,color="black",shape="box"];4876 -> 5078[label="",style="solid", color="black", weight=3];
9052[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (False && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9052 -> 9111[label="",style="solid", color="black", weight=3];
9053[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (True && Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9053 -> 9112[label="",style="solid", color="black", weight=3];
4884[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];4884 -> 5087[label="",style="solid", color="black", weight=3];
4885 -> 7945[label="",style="dashed", color="red", weight=0];
4885[label="index12 (Neg Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpNat (Succ zx6700) (Succ zx6700) == GT))",fontsize=16,color="magenta"];4885 -> 7946[label="",style="dashed", color="magenta", weight=3];
4885 -> 7947[label="",style="dashed", color="magenta", weight=3];
4886[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (not (EQ == GT))",fontsize=16,color="black",shape="box"];4886 -> 5089[label="",style="solid", color="black", weight=3];
4887 -> 2397[label="",style="dashed", color="red", weight=0];
4887[label="error []",fontsize=16,color="magenta"];4888[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (not (EQ == GT))",fontsize=16,color="black",shape="box"];4888 -> 5090[label="",style="solid", color="black", weight=3];
4889[label="index3 LT LT (not (EQ == LT))",fontsize=16,color="black",shape="box"];4889 -> 5091[label="",style="solid", color="black", weight=3];
4890[label="index3 LT EQ (not (compare1 LT EQ (LT <= EQ) == LT))",fontsize=16,color="black",shape="box"];4890 -> 5092[label="",style="solid", color="black", weight=3];
4891[label="index3 LT GT (not (compare1 LT GT (LT <= GT) == LT))",fontsize=16,color="black",shape="box"];4891 -> 5093[label="",style="solid", color="black", weight=3];
4892[label="index3 EQ LT (not (compare1 EQ LT (EQ <= LT) == LT))",fontsize=16,color="black",shape="box"];4892 -> 5094[label="",style="solid", color="black", weight=3];
4893[label="index3 EQ EQ (not (EQ == LT))",fontsize=16,color="black",shape="box"];4893 -> 5095[label="",style="solid", color="black", weight=3];
4894[label="index3 EQ GT (not (compare1 EQ GT (EQ <= GT) == LT))",fontsize=16,color="black",shape="box"];4894 -> 5096[label="",style="solid", color="black", weight=3];
4895[label="index3 GT LT (not (compare1 GT LT (GT <= LT) == LT))",fontsize=16,color="black",shape="box"];4895 -> 5097[label="",style="solid", color="black", weight=3];
4896[label="index3 GT EQ (not (compare1 GT EQ (GT <= EQ) == LT))",fontsize=16,color="black",shape="box"];4896 -> 5098[label="",style="solid", color="black", weight=3];
4897[label="index3 GT GT (not (EQ == LT))",fontsize=16,color="black",shape="box"];4897 -> 5099[label="",style="solid", color="black", weight=3];
4898[label="index2 False False (not (EQ == LT))",fontsize=16,color="black",shape="box"];4898 -> 5100[label="",style="solid", color="black", weight=3];
4899[label="index2 False True (not (compare1 False True (False <= True) == LT))",fontsize=16,color="black",shape="box"];4899 -> 5101[label="",style="solid", color="black", weight=3];
4900[label="index2 True False (not (compare1 True False (True <= False) == LT))",fontsize=16,color="black",shape="box"];4900 -> 5102[label="",style="solid", color="black", weight=3];
4901[label="index2 True True (not (EQ == LT))",fontsize=16,color="black",shape="box"];4901 -> 5103[label="",style="solid", color="black", weight=3];
4902[label="zx15800",fontsize=16,color="green",shape="box"];4903[label="zx160000",fontsize=16,color="green",shape="box"];4969[label="zx2370",fontsize=16,color="green",shape="box"];4970[label="zx2380",fontsize=16,color="green",shape="box"];4971 -> 4010[label="",style="dashed", color="red", weight=0];
4971[label="primPlusNat zx2380 zx2370",fontsize=16,color="magenta"];4971 -> 5163[label="",style="dashed", color="magenta", weight=3];
4971 -> 5164[label="",style="dashed", color="magenta", weight=3];
4972 -> 4010[label="",style="dashed", color="red", weight=0];
4972[label="primPlusNat zx2380 zx2370",fontsize=16,color="magenta"];4972 -> 5165[label="",style="dashed", color="magenta", weight=3];
4972 -> 5166[label="",style="dashed", color="magenta", weight=3];
4973[label="zx2380",fontsize=16,color="green",shape="box"];4974[label="zx2370",fontsize=16,color="green",shape="box"];4979[label="rangeSize1 EQ LT (null ((++) range40 EQ (not (compare1 LT EQ True == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4979 -> 5174[label="",style="solid", color="black", weight=3];
4980[label="rangeSize1 GT LT (null ((++) range40 EQ (not (compare1 LT EQ True == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4980 -> 5175[label="",style="solid", color="black", weight=3];
4981[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare3 EQ EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4981 -> 5176[label="",style="solid", color="black", weight=3];
6427[label="(++) range40 EQ (compare EQ EQ /= LT && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];6427 -> 6611[label="",style="solid", color="black", weight=3];
4983[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare3 GT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];4983 -> 5178[label="",style="solid", color="black", weight=3];
4984[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare3 GT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];4984 -> 5179[label="",style="solid", color="black", weight=3];
4985[label="rangeSize1 True False (null ((++) range00 True (not (compare1 False True True == LT) && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];4985 -> 5180[label="",style="solid", color="black", weight=3];
4986[label="rangeSize1 True True (null ((++) range00 True (not (compare3 True True == LT) && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];4986 -> 5181[label="",style="solid", color="black", weight=3];
7700[label="Integer zx519",fontsize=16,color="green",shape="box"];7701[label="Integer (Neg (Succ zx487))",fontsize=16,color="green",shape="box"];5027[label="(++) range40 EQ (LT >= EQ && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];5027 -> 5220[label="",style="solid", color="black", weight=3];
5028[label="(++) range40 EQ (LT >= EQ && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];5028 -> 5221[label="",style="solid", color="black", weight=3];
5029[label="(++) range40 EQ (LT >= EQ && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];5029 -> 5222[label="",style="solid", color="black", weight=3];
5030[label="[] ++ foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5030 -> 5223[label="",style="solid", color="black", weight=3];
5031[label="(++) [] foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5031 -> 5224[label="",style="solid", color="black", weight=3];
5033[label="[] ++ foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5033 -> 5226[label="",style="solid", color="black", weight=3];
5034[label="(++) [] foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5034 -> 5227[label="",style="solid", color="black", weight=3];
5035[label="(++) [] foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5035 -> 5228[label="",style="solid", color="black", weight=3];
5036[label="(++) range00 True (False >= True && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];5036 -> 5229[label="",style="solid", color="black", weight=3];
5037[label="(++) range00 True (False >= True && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];5037 -> 5230[label="",style="solid", color="black", weight=3];
5038[label="[] ++ foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];5038 -> 5231[label="",style="solid", color="black", weight=3];
5039[label="(++) [] foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];5039 -> 5232[label="",style="solid", color="black", weight=3];
9362[label="zx6540",fontsize=16,color="green",shape="box"];9363[label="zx6550",fontsize=16,color="green",shape="box"];9364[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not True && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9364 -> 9377[label="",style="solid", color="black", weight=3];
9365[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not False && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="triangle"];9365 -> 9378[label="",style="solid", color="black", weight=3];
9366 -> 9365[label="",style="dashed", color="red", weight=0];
9366[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not False && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="magenta"];5047[label="index4 (Integer (Pos (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];5047 -> 5240[label="",style="solid", color="black", weight=3];
5048[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (compare (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) == GT))",fontsize=16,color="black",shape="box"];5048 -> 5241[label="",style="solid", color="black", weight=3];
5049[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];5049 -> 5242[label="",style="solid", color="black", weight=3];
5050 -> 2397[label="",style="dashed", color="red", weight=0];
5050[label="error []",fontsize=16,color="magenta"];5051[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];5051 -> 5243[label="",style="solid", color="black", weight=3];
5052[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpInt (Pos (Succ zx67000)) (Pos (Succ zx67000)) == GT))",fontsize=16,color="black",shape="box"];5052 -> 5244[label="",style="solid", color="black", weight=3];
5053[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];5053 -> 5245[label="",style="solid", color="black", weight=3];
9372[label="zx6600",fontsize=16,color="green",shape="box"];9373[label="zx6590",fontsize=16,color="green",shape="box"];9374[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not True && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9374 -> 9459[label="",style="solid", color="black", weight=3];
9375[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not False && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="triangle"];9375 -> 9460[label="",style="solid", color="black", weight=3];
9376 -> 9375[label="",style="dashed", color="red", weight=0];
9376[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not False && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="magenta"];5061[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (compare (Integer (Neg Zero)) (Integer (Neg Zero)) == GT))",fontsize=16,color="black",shape="box"];5061 -> 5253[label="",style="solid", color="black", weight=3];
5062[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpInt (Pos (Succ zx67000)) (Pos (Succ zx67000)) == GT))",fontsize=16,color="black",shape="box"];5062 -> 5254[label="",style="solid", color="black", weight=3];
5063[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];5063 -> 5255[label="",style="solid", color="black", weight=3];
5064[label="index4 (Integer (Neg Zero)) (Integer (Neg (Succ zx67000))) (Integer (Neg (Succ zx67000))) True",fontsize=16,color="black",shape="box"];5064 -> 5256[label="",style="solid", color="black", weight=3];
5065[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];5065 -> 5257[label="",style="solid", color="black", weight=3];
9054[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) False",fontsize=16,color="black",shape="box"];9054 -> 9113[label="",style="solid", color="black", weight=3];
9055[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (Pos (Succ zx627) <= Pos (Succ zx627))",fontsize=16,color="black",shape="box"];9055 -> 9114[label="",style="solid", color="black", weight=3];
5074 -> 7723[label="",style="dashed", color="red", weight=0];
5074[label="index12 (Pos Zero) (Pos (Succ zx6700)) (Pos (Succ zx6700)) (not (primCmpNat (Succ zx6700) (Succ zx6700) == GT))",fontsize=16,color="magenta"];5074 -> 7724[label="",style="dashed", color="magenta", weight=3];
5074 -> 7725[label="",style="dashed", color="magenta", weight=3];
5075[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) (not False)",fontsize=16,color="black",shape="box"];5075 -> 5269[label="",style="solid", color="black", weight=3];
5076[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) (not False)",fontsize=16,color="black",shape="box"];5076 -> 5270[label="",style="solid", color="black", weight=3];
7507[label="zx6700",fontsize=16,color="green",shape="box"];7508[label="Succ zx6700",fontsize=16,color="green",shape="box"];7509[label="zx6400",fontsize=16,color="green",shape="box"];7506[label="index12 (Neg (Succ zx504)) (Pos (Succ zx505)) (Pos (Succ zx505)) (not (primCmpNat zx506 zx506 == GT))",fontsize=16,color="burlywood",shape="triangle"];11878[label="zx506/Succ zx5060",fontsize=10,color="white",style="solid",shape="box"];7506 -> 11878[label="",style="solid", color="burlywood", weight=9];
11878 -> 7530[label="",style="solid", color="burlywood", weight=3];
11879[label="zx506/Zero",fontsize=10,color="white",style="solid",shape="box"];7506 -> 11879[label="",style="solid", color="burlywood", weight=9];
11879 -> 7531[label="",style="solid", color="burlywood", weight=3];
5078[label="index12 (Neg (Succ zx6400)) (Pos Zero) (Pos Zero) (not False)",fontsize=16,color="black",shape="box"];5078 -> 5273[label="",style="solid", color="black", weight=3];
9111[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) False",fontsize=16,color="black",shape="box"];9111 -> 9204[label="",style="solid", color="black", weight=3];
9112[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (Neg (Succ zx632) <= Neg (Succ zx632))",fontsize=16,color="black",shape="box"];9112 -> 9205[label="",style="solid", color="black", weight=3];
5087[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (not (EQ == GT))",fontsize=16,color="black",shape="box"];5087 -> 5284[label="",style="solid", color="black", weight=3];
7946[label="zx6700",fontsize=16,color="green",shape="box"];7947[label="Succ zx6700",fontsize=16,color="green",shape="box"];7945[label="index12 (Neg Zero) (Pos (Succ zx544)) (Pos (Succ zx544)) (not (primCmpNat zx545 zx545 == GT))",fontsize=16,color="burlywood",shape="triangle"];11880[label="zx545/Succ zx5450",fontsize=10,color="white",style="solid",shape="box"];7945 -> 11880[label="",style="solid", color="burlywood", weight=9];
11880 -> 7962[label="",style="solid", color="burlywood", weight=3];
11881[label="zx545/Zero",fontsize=10,color="white",style="solid",shape="box"];7945 -> 11881[label="",style="solid", color="burlywood", weight=9];
11881 -> 7963[label="",style="solid", color="burlywood", weight=3];
5089[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) (not False)",fontsize=16,color="black",shape="box"];5089 -> 5287[label="",style="solid", color="black", weight=3];
5090[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) (not False)",fontsize=16,color="black",shape="box"];5090 -> 5288[label="",style="solid", color="black", weight=3];
5091[label="index3 LT LT (not False)",fontsize=16,color="black",shape="box"];5091 -> 5289[label="",style="solid", color="black", weight=3];
5092[label="index3 LT EQ (not (compare1 LT EQ True == LT))",fontsize=16,color="black",shape="box"];5092 -> 5290[label="",style="solid", color="black", weight=3];
5093[label="index3 LT GT (not (compare1 LT GT True == LT))",fontsize=16,color="black",shape="box"];5093 -> 5291[label="",style="solid", color="black", weight=3];
5094[label="index3 EQ LT (not (compare1 EQ LT False == LT))",fontsize=16,color="black",shape="box"];5094 -> 5292[label="",style="solid", color="black", weight=3];
5095[label="index3 EQ EQ (not False)",fontsize=16,color="black",shape="box"];5095 -> 5293[label="",style="solid", color="black", weight=3];
5096[label="index3 EQ GT (not (compare1 EQ GT True == LT))",fontsize=16,color="black",shape="box"];5096 -> 5294[label="",style="solid", color="black", weight=3];
5097[label="index3 GT LT (not (compare1 GT LT False == LT))",fontsize=16,color="black",shape="box"];5097 -> 5295[label="",style="solid", color="black", weight=3];
5098[label="index3 GT EQ (not (compare1 GT EQ False == LT))",fontsize=16,color="black",shape="box"];5098 -> 5296[label="",style="solid", color="black", weight=3];
5099[label="index3 GT GT (not False)",fontsize=16,color="black",shape="box"];5099 -> 5297[label="",style="solid", color="black", weight=3];
5100[label="index2 False False (not False)",fontsize=16,color="black",shape="box"];5100 -> 5298[label="",style="solid", color="black", weight=3];
5101[label="index2 False True (not (compare1 False True True == LT))",fontsize=16,color="black",shape="box"];5101 -> 5299[label="",style="solid", color="black", weight=3];
5102[label="index2 True False (not (compare1 True False False == LT))",fontsize=16,color="black",shape="box"];5102 -> 5300[label="",style="solid", color="black", weight=3];
5103[label="index2 True True (not False)",fontsize=16,color="black",shape="box"];5103 -> 5301[label="",style="solid", color="black", weight=3];
5163[label="zx2370",fontsize=16,color="green",shape="box"];5164[label="zx2380",fontsize=16,color="green",shape="box"];5165[label="zx2370",fontsize=16,color="green",shape="box"];5166[label="zx2380",fontsize=16,color="green",shape="box"];5174[label="rangeSize1 EQ LT (null ((++) range40 EQ (not (LT == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5174 -> 5342[label="",style="solid", color="black", weight=3];
5175[label="rangeSize1 GT LT (null ((++) range40 EQ (not (LT == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];5175 -> 5343[label="",style="solid", color="black", weight=3];
5176[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5176 -> 5344[label="",style="solid", color="black", weight=3];
6611[label="(++) range40 EQ (not (compare EQ EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];6611 -> 6766[label="",style="solid", color="black", weight=3];
5178[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare2 GT EQ (GT == EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5178 -> 5346[label="",style="solid", color="black", weight=3];
5179[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare2 GT EQ (GT == EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];5179 -> 5347[label="",style="solid", color="black", weight=3];
5180[label="rangeSize1 True False (null ((++) range00 True (not (LT == LT) && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];5180 -> 5348[label="",style="solid", color="black", weight=3];
5181[label="rangeSize1 True True (null ((++) range00 True (not (compare2 True True (True == True) == LT) && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];5181 -> 5349[label="",style="solid", color="black", weight=3];
5220[label="(++) range40 EQ (compare LT EQ /= LT && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];5220 -> 5387[label="",style="solid", color="black", weight=3];
5221[label="(++) range40 EQ (compare LT EQ /= LT && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];5221 -> 5388[label="",style="solid", color="black", weight=3];
5222[label="(++) range40 EQ (compare LT EQ /= LT && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];5222 -> 5389[label="",style="solid", color="black", weight=3];
5223[label="foldr (++) [] (map (range4 EQ LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5223 -> 5390[label="",style="solid", color="black", weight=3];
5224[label="foldr (++) [] (map (range4 EQ EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5224 -> 5391[label="",style="solid", color="black", weight=3];
5226[label="foldr (++) [] (map (range4 GT LT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5226 -> 5393[label="",style="solid", color="black", weight=3];
5227[label="foldr (++) [] (map (range4 GT EQ) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5227 -> 5394[label="",style="solid", color="black", weight=3];
5228[label="foldr (++) [] (map (range4 GT GT) (EQ : GT : []))",fontsize=16,color="black",shape="box"];5228 -> 5395[label="",style="solid", color="black", weight=3];
5229[label="(++) range00 True (compare False True /= LT && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];5229 -> 5396[label="",style="solid", color="black", weight=3];
5230[label="(++) range00 True (compare False True /= LT && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];5230 -> 5397[label="",style="solid", color="black", weight=3];
5231[label="foldr (++) [] (map (range0 True False) (True : []))",fontsize=16,color="black",shape="box"];5231 -> 5398[label="",style="solid", color="black", weight=3];
5232[label="foldr (++) [] (map (range0 True True) (True : []))",fontsize=16,color="black",shape="box"];5232 -> 5399[label="",style="solid", color="black", weight=3];
9377[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (False && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9377 -> 9461[label="",style="solid", color="black", weight=3];
9378[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (True && Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9378 -> 9462[label="",style="solid", color="black", weight=3];
5240 -> 2397[label="",style="dashed", color="red", weight=0];
5240[label="error []",fontsize=16,color="magenta"];5241[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpInt (Pos (Succ zx67000)) (Pos (Succ zx67000)) == GT))",fontsize=16,color="black",shape="box"];5241 -> 5408[label="",style="solid", color="black", weight=3];
5242[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];5242 -> 5409[label="",style="solid", color="black", weight=3];
5243[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];5243 -> 5410[label="",style="solid", color="black", weight=3];
5244 -> 7832[label="",style="dashed", color="red", weight=0];
5244[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpNat (Succ zx67000) (Succ zx67000) == GT))",fontsize=16,color="magenta"];5244 -> 7833[label="",style="dashed", color="magenta", weight=3];
5244 -> 7834[label="",style="dashed", color="magenta", weight=3];
5244 -> 7835[label="",style="dashed", color="magenta", weight=3];
5245[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];5245 -> 5412[label="",style="solid", color="black", weight=3];
9459[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (False && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9459 -> 9475[label="",style="solid", color="black", weight=3];
9460[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (True && Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9460 -> 9476[label="",style="solid", color="black", weight=3];
5253[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Neg Zero) == GT))",fontsize=16,color="black",shape="box"];5253 -> 5421[label="",style="solid", color="black", weight=3];
5254 -> 8230[label="",style="dashed", color="red", weight=0];
5254[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpNat (Succ zx67000) (Succ zx67000) == GT))",fontsize=16,color="magenta"];5254 -> 8231[label="",style="dashed", color="magenta", weight=3];
5254 -> 8232[label="",style="dashed", color="magenta", weight=3];
5255[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];5255 -> 5423[label="",style="solid", color="black", weight=3];
5256 -> 2397[label="",style="dashed", color="red", weight=0];
5256[label="error []",fontsize=16,color="magenta"];5257[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];5257 -> 5424[label="",style="solid", color="black", weight=3];
9113[label="index11 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) otherwise",fontsize=16,color="black",shape="box"];9113 -> 9206[label="",style="solid", color="black", weight=3];
9114[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (compare (Pos (Succ zx627)) (Pos (Succ zx627)) /= GT)",fontsize=16,color="black",shape="box"];9114 -> 9207[label="",style="solid", color="black", weight=3];
7724[label="Succ zx6700",fontsize=16,color="green",shape="box"];7725[label="zx6700",fontsize=16,color="green",shape="box"];7723[label="index12 (Pos Zero) (Pos (Succ zx525)) (Pos (Succ zx525)) (not (primCmpNat zx526 zx526 == GT))",fontsize=16,color="burlywood",shape="triangle"];11886[label="zx526/Succ zx5260",fontsize=10,color="white",style="solid",shape="box"];7723 -> 11886[label="",style="solid", color="burlywood", weight=9];
11886 -> 7739[label="",style="solid", color="burlywood", weight=3];
11887[label="zx526/Zero",fontsize=10,color="white",style="solid",shape="box"];7723 -> 11887[label="",style="solid", color="burlywood", weight=9];
11887 -> 7740[label="",style="solid", color="burlywood", weight=3];
5269[label="index12 (Pos Zero) (Pos Zero) (Pos Zero) True",fontsize=16,color="black",shape="box"];5269 -> 5437[label="",style="solid", color="black", weight=3];
5270[label="index12 (Pos Zero) (Neg Zero) (Neg Zero) True",fontsize=16,color="black",shape="box"];5270 -> 5438[label="",style="solid", color="black", weight=3];
7530[label="index12 (Neg (Succ zx504)) (Pos (Succ zx505)) (Pos (Succ zx505)) (not (primCmpNat (Succ zx5060) (Succ zx5060) == GT))",fontsize=16,color="black",shape="box"];7530 -> 7548[label="",style="solid", color="black", weight=3];
7531[label="index12 (Neg (Succ zx504)) (Pos (Succ zx505)) (Pos (Succ zx505)) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];7531 -> 7549[label="",style="solid", color="black", weight=3];
5273[label="index12 (Neg (Succ zx6400)) (Pos Zero) (Pos Zero) True",fontsize=16,color="black",shape="box"];5273 -> 5441[label="",style="solid", color="black", weight=3];
9204[label="index11 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) otherwise",fontsize=16,color="black",shape="box"];9204 -> 9257[label="",style="solid", color="black", weight=3];
9205[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (compare (Neg (Succ zx632)) (Neg (Succ zx632)) /= GT)",fontsize=16,color="black",shape="box"];9205 -> 9258[label="",style="solid", color="black", weight=3];
5284[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) (not False)",fontsize=16,color="black",shape="box"];5284 -> 5452[label="",style="solid", color="black", weight=3];
7962[label="index12 (Neg Zero) (Pos (Succ zx544)) (Pos (Succ zx544)) (not (primCmpNat (Succ zx5450) (Succ zx5450) == GT))",fontsize=16,color="black",shape="box"];7962 -> 8003[label="",style="solid", color="black", weight=3];
7963[label="index12 (Neg Zero) (Pos (Succ zx544)) (Pos (Succ zx544)) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];7963 -> 8004[label="",style="solid", color="black", weight=3];
5287[label="index12 (Neg Zero) (Pos Zero) (Pos Zero) True",fontsize=16,color="black",shape="box"];5287 -> 5455[label="",style="solid", color="black", weight=3];
5288[label="index12 (Neg Zero) (Neg Zero) (Neg Zero) True",fontsize=16,color="black",shape="box"];5288 -> 5456[label="",style="solid", color="black", weight=3];
5289[label="index3 LT LT True",fontsize=16,color="black",shape="box"];5289 -> 5457[label="",style="solid", color="black", weight=3];
5290[label="index3 LT EQ (not (LT == LT))",fontsize=16,color="black",shape="box"];5290 -> 5458[label="",style="solid", color="black", weight=3];
5291[label="index3 LT GT (not (LT == LT))",fontsize=16,color="black",shape="box"];5291 -> 5459[label="",style="solid", color="black", weight=3];
5292[label="index3 EQ LT (not (compare0 EQ LT otherwise == LT))",fontsize=16,color="black",shape="box"];5292 -> 5460[label="",style="solid", color="black", weight=3];
5293[label="index3 EQ EQ True",fontsize=16,color="black",shape="box"];5293 -> 5461[label="",style="solid", color="black", weight=3];
5294[label="index3 EQ GT (not (LT == LT))",fontsize=16,color="black",shape="box"];5294 -> 5462[label="",style="solid", color="black", weight=3];
5295[label="index3 GT LT (not (compare0 GT LT otherwise == LT))",fontsize=16,color="black",shape="box"];5295 -> 5463[label="",style="solid", color="black", weight=3];
5296[label="index3 GT EQ (not (compare0 GT EQ otherwise == LT))",fontsize=16,color="black",shape="box"];5296 -> 5464[label="",style="solid", color="black", weight=3];
5297[label="index3 GT GT True",fontsize=16,color="black",shape="box"];5297 -> 5465[label="",style="solid", color="black", weight=3];
5298[label="index2 False False True",fontsize=16,color="black",shape="box"];5298 -> 5466[label="",style="solid", color="black", weight=3];
5299[label="index2 False True (not (LT == LT))",fontsize=16,color="black",shape="box"];5299 -> 5467[label="",style="solid", color="black", weight=3];
5300[label="index2 True False (not (compare0 True False otherwise == LT))",fontsize=16,color="black",shape="box"];5300 -> 5468[label="",style="solid", color="black", weight=3];
5301[label="index2 True True True",fontsize=16,color="black",shape="box"];5301 -> 5469[label="",style="solid", color="black", weight=3];
5342[label="rangeSize1 EQ LT (null ((++) range40 EQ (not True && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5342 -> 5611[label="",style="solid", color="black", weight=3];
5343[label="rangeSize1 GT LT (null ((++) range40 EQ (not True && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];5343 -> 5612[label="",style="solid", color="black", weight=3];
5344[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare2 EQ EQ True == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5344 -> 5613[label="",style="solid", color="black", weight=3];
6766[label="(++) range40 EQ (not (compare3 EQ EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];6766 -> 6900[label="",style="solid", color="black", weight=3];
5346[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare2 GT EQ False == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5346 -> 5615[label="",style="solid", color="black", weight=3];
5347[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare2 GT EQ False == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];5347 -> 5616[label="",style="solid", color="black", weight=3];
5348[label="rangeSize1 True False (null ((++) range00 True (not True && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];5348 -> 5617[label="",style="solid", color="black", weight=3];
5349[label="rangeSize1 True True (null ((++) range00 True (not (compare2 True True True == LT) && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];5349 -> 5618[label="",style="solid", color="black", weight=3];
5387[label="(++) range40 EQ (not (compare LT EQ == LT) && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];5387 -> 5651[label="",style="solid", color="black", weight=3];
5388[label="(++) range40 EQ (not (compare LT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];5388 -> 5652[label="",style="solid", color="black", weight=3];
5389[label="(++) range40 EQ (not (compare LT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];5389 -> 5653[label="",style="solid", color="black", weight=3];
5390[label="foldr (++) [] (range4 EQ LT EQ : map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];5390 -> 5654[label="",style="solid", color="black", weight=3];
5391[label="foldr (++) [] (range4 EQ EQ EQ : map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];5391 -> 5655[label="",style="solid", color="black", weight=3];
5393[label="foldr (++) [] (range4 GT LT EQ : map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];5393 -> 5657[label="",style="solid", color="black", weight=3];
5394[label="foldr (++) [] (range4 GT EQ EQ : map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];5394 -> 5658[label="",style="solid", color="black", weight=3];
5395[label="foldr (++) [] (range4 GT GT EQ : map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];5395 -> 5659[label="",style="solid", color="black", weight=3];
5396[label="(++) range00 True (not (compare False True == LT) && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];5396 -> 5660[label="",style="solid", color="black", weight=3];
5397[label="(++) range00 True (not (compare False True == LT) && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];5397 -> 5661[label="",style="solid", color="black", weight=3];
5398[label="foldr (++) [] (range0 True False True : map (range0 True False) [])",fontsize=16,color="black",shape="box"];5398 -> 5662[label="",style="solid", color="black", weight=3];
5399[label="foldr (++) [] (range0 True True True : map (range0 True True) [])",fontsize=16,color="black",shape="box"];5399 -> 5663[label="",style="solid", color="black", weight=3];
9461[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) False",fontsize=16,color="black",shape="box"];9461 -> 9477[label="",style="solid", color="black", weight=3];
9462[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653)) <= Integer (Pos (Succ zx653)))",fontsize=16,color="black",shape="box"];9462 -> 9478[label="",style="solid", color="black", weight=3];
5408 -> 8054[label="",style="dashed", color="red", weight=0];
5408[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx67000))) (Integer (Pos (Succ zx67000))) (not (primCmpNat (Succ zx67000) (Succ zx67000) == GT))",fontsize=16,color="magenta"];5408 -> 8055[label="",style="dashed", color="magenta", weight=3];
5408 -> 8056[label="",style="dashed", color="magenta", weight=3];
5409[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];5409 -> 5675[label="",style="solid", color="black", weight=3];
5410[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not False)",fontsize=16,color="black",shape="box"];5410 -> 5676[label="",style="solid", color="black", weight=3];
7833[label="Succ zx67000",fontsize=16,color="green",shape="box"];7834[label="zx64000",fontsize=16,color="green",shape="box"];7835[label="zx67000",fontsize=16,color="green",shape="box"];7832[label="index5 (Integer (Neg (Succ zx531))) (Integer (Pos (Succ zx532))) (Integer (Pos (Succ zx532))) (not (primCmpNat zx533 zx533 == GT))",fontsize=16,color="burlywood",shape="triangle"];11889[label="zx533/Succ zx5330",fontsize=10,color="white",style="solid",shape="box"];7832 -> 11889[label="",style="solid", color="burlywood", weight=9];
11889 -> 7855[label="",style="solid", color="burlywood", weight=3];
11890[label="zx533/Zero",fontsize=10,color="white",style="solid",shape="box"];7832 -> 11890[label="",style="solid", color="burlywood", weight=9];
11890 -> 7856[label="",style="solid", color="burlywood", weight=3];
5412[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];5412 -> 5679[label="",style="solid", color="black", weight=3];
9475[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) False",fontsize=16,color="black",shape="box"];9475 -> 9574[label="",style="solid", color="black", weight=3];
9476[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658)) <= Integer (Neg (Succ zx658)))",fontsize=16,color="black",shape="box"];9476 -> 9575[label="",style="solid", color="black", weight=3];
5421[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];5421 -> 5690[label="",style="solid", color="black", weight=3];
8231[label="Succ zx67000",fontsize=16,color="green",shape="box"];8232[label="zx67000",fontsize=16,color="green",shape="box"];8230[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx568))) (Integer (Pos (Succ zx568))) (not (primCmpNat zx569 zx569 == GT))",fontsize=16,color="burlywood",shape="triangle"];11891[label="zx569/Succ zx5690",fontsize=10,color="white",style="solid",shape="box"];8230 -> 11891[label="",style="solid", color="burlywood", weight=9];
11891 -> 8249[label="",style="solid", color="burlywood", weight=3];
11892[label="zx569/Zero",fontsize=10,color="white",style="solid",shape="box"];8230 -> 11892[label="",style="solid", color="burlywood", weight=9];
11892 -> 8250[label="",style="solid", color="burlywood", weight=3];
5423[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];5423 -> 5693[label="",style="solid", color="black", weight=3];
5424[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) (not False)",fontsize=16,color="black",shape="box"];5424 -> 5694[label="",style="solid", color="black", weight=3];
9206[label="index11 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) True",fontsize=16,color="black",shape="box"];9206 -> 9259[label="",style="solid", color="black", weight=3];
9207[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (compare (Pos (Succ zx627)) (Pos (Succ zx627)) == GT))",fontsize=16,color="black",shape="box"];9207 -> 9260[label="",style="solid", color="black", weight=3];
7739[label="index12 (Pos Zero) (Pos (Succ zx525)) (Pos (Succ zx525)) (not (primCmpNat (Succ zx5260) (Succ zx5260) == GT))",fontsize=16,color="black",shape="box"];7739 -> 7763[label="",style="solid", color="black", weight=3];
7740[label="index12 (Pos Zero) (Pos (Succ zx525)) (Pos (Succ zx525)) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];7740 -> 7764[label="",style="solid", color="black", weight=3];
5437 -> 3767[label="",style="dashed", color="red", weight=0];
5437[label="Pos Zero - Pos Zero",fontsize=16,color="magenta"];5437 -> 5707[label="",style="dashed", color="magenta", weight=3];
5437 -> 5708[label="",style="dashed", color="magenta", weight=3];
5438 -> 3767[label="",style="dashed", color="red", weight=0];
5438[label="Neg Zero - Pos Zero",fontsize=16,color="magenta"];5438 -> 5709[label="",style="dashed", color="magenta", weight=3];
5438 -> 5710[label="",style="dashed", color="magenta", weight=3];
7548 -> 7506[label="",style="dashed", color="red", weight=0];
7548[label="index12 (Neg (Succ zx504)) (Pos (Succ zx505)) (Pos (Succ zx505)) (not (primCmpNat zx5060 zx5060 == GT))",fontsize=16,color="magenta"];7548 -> 7562[label="",style="dashed", color="magenta", weight=3];
7549[label="index12 (Neg (Succ zx504)) (Pos (Succ zx505)) (Pos (Succ zx505)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];7549 -> 7563[label="",style="solid", color="black", weight=3];
5441 -> 3767[label="",style="dashed", color="red", weight=0];
5441[label="Pos Zero - Neg (Succ zx6400)",fontsize=16,color="magenta"];5441 -> 5714[label="",style="dashed", color="magenta", weight=3];
5441 -> 5715[label="",style="dashed", color="magenta", weight=3];
9257[label="index11 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) True",fontsize=16,color="black",shape="box"];9257 -> 9315[label="",style="solid", color="black", weight=3];
9258[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (compare (Neg (Succ zx632)) (Neg (Succ zx632)) == GT))",fontsize=16,color="black",shape="box"];9258 -> 9316[label="",style="solid", color="black", weight=3];
5452[label="index12 (Neg (Succ zx6400)) (Neg Zero) (Neg Zero) True",fontsize=16,color="black",shape="box"];5452 -> 5726[label="",style="solid", color="black", weight=3];
8003 -> 7945[label="",style="dashed", color="red", weight=0];
8003[label="index12 (Neg Zero) (Pos (Succ zx544)) (Pos (Succ zx544)) (not (primCmpNat zx5450 zx5450 == GT))",fontsize=16,color="magenta"];8003 -> 8013[label="",style="dashed", color="magenta", weight=3];
8004[label="index12 (Neg Zero) (Pos (Succ zx544)) (Pos (Succ zx544)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];8004 -> 8014[label="",style="solid", color="black", weight=3];
5455 -> 3767[label="",style="dashed", color="red", weight=0];
5455[label="Pos Zero - Neg Zero",fontsize=16,color="magenta"];5455 -> 5730[label="",style="dashed", color="magenta", weight=3];
5455 -> 5731[label="",style="dashed", color="magenta", weight=3];
5456 -> 3767[label="",style="dashed", color="red", weight=0];
5456[label="Neg Zero - Neg Zero",fontsize=16,color="magenta"];5456 -> 5732[label="",style="dashed", color="magenta", weight=3];
5456 -> 5733[label="",style="dashed", color="magenta", weight=3];
5457 -> 5734[label="",style="dashed", color="red", weight=0];
5457[label="sum (map (index1 LT) (range (LT,LT)))",fontsize=16,color="magenta"];5457 -> 5735[label="",style="dashed", color="magenta", weight=3];
5458[label="index3 LT EQ (not True)",fontsize=16,color="black",shape="box"];5458 -> 5744[label="",style="solid", color="black", weight=3];
5459[label="index3 LT GT (not True)",fontsize=16,color="black",shape="box"];5459 -> 5745[label="",style="solid", color="black", weight=3];
5460[label="index3 EQ LT (not (compare0 EQ LT True == LT))",fontsize=16,color="black",shape="box"];5460 -> 5746[label="",style="solid", color="black", weight=3];
5461 -> 5747[label="",style="dashed", color="red", weight=0];
5461[label="sum (map (index1 EQ) (range (EQ,EQ)))",fontsize=16,color="magenta"];5461 -> 5748[label="",style="dashed", color="magenta", weight=3];
5462[label="index3 EQ GT (not True)",fontsize=16,color="black",shape="box"];5462 -> 5757[label="",style="solid", color="black", weight=3];
5463[label="index3 GT LT (not (compare0 GT LT True == LT))",fontsize=16,color="black",shape="box"];5463 -> 5758[label="",style="solid", color="black", weight=3];
5464[label="index3 GT EQ (not (compare0 GT EQ True == LT))",fontsize=16,color="black",shape="box"];5464 -> 5759[label="",style="solid", color="black", weight=3];
5465 -> 5760[label="",style="dashed", color="red", weight=0];
5465[label="sum (map (index1 GT) (range (GT,GT)))",fontsize=16,color="magenta"];5465 -> 5761[label="",style="dashed", color="magenta", weight=3];
5466 -> 5781[label="",style="dashed", color="red", weight=0];
5466[label="sum (map (index0 False) (range (False,False)))",fontsize=16,color="magenta"];5466 -> 5782[label="",style="dashed", color="magenta", weight=3];
5467[label="index2 False True (not True)",fontsize=16,color="black",shape="box"];5467 -> 5853[label="",style="solid", color="black", weight=3];
5468[label="index2 True False (not (compare0 True False True == LT))",fontsize=16,color="black",shape="box"];5468 -> 5854[label="",style="solid", color="black", weight=3];
5469 -> 5855[label="",style="dashed", color="red", weight=0];
5469[label="sum (map (index0 True) (range (True,True)))",fontsize=16,color="magenta"];5469 -> 5856[label="",style="dashed", color="magenta", weight=3];
5611[label="rangeSize1 EQ LT (null ((++) range40 EQ (False && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5611 -> 6082[label="",style="solid", color="black", weight=3];
5612[label="rangeSize1 GT LT (null ((++) range40 EQ (False && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];5612 -> 6083[label="",style="solid", color="black", weight=3];
5613[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5613 -> 6084[label="",style="solid", color="black", weight=3];
6900[label="(++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];6900 -> 7084[label="",style="solid", color="black", weight=3];
5615[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare1 GT EQ (GT <= EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];5615 -> 6086[label="",style="solid", color="black", weight=3];
5616[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare1 GT EQ (GT <= EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];5616 -> 6087[label="",style="solid", color="black", weight=3];
5617[label="rangeSize1 True False (null ((++) range00 True (False && True >= True) foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];5617 -> 6088[label="",style="solid", color="black", weight=3];
5618[label="rangeSize1 True True (null ((++) range00 True (not (EQ == LT) && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];5618 -> 6089[label="",style="solid", color="black", weight=3];
5651[label="(++) range40 EQ (not (compare3 LT EQ == LT) && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];5651 -> 6130[label="",style="solid", color="black", weight=3];
5652[label="(++) range40 EQ (not (compare3 LT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];5652 -> 6131[label="",style="solid", color="black", weight=3];
5653[label="(++) range40 EQ (not (compare3 LT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];5653 -> 6132[label="",style="solid", color="black", weight=3];
5654[label="(++) range4 EQ LT EQ foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];5654 -> 6133[label="",style="solid", color="black", weight=3];
5655[label="(++) range4 EQ EQ EQ foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];5655 -> 6134[label="",style="solid", color="black", weight=3];
5657[label="(++) range4 GT LT EQ foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];5657 -> 6136[label="",style="solid", color="black", weight=3];
5658[label="(++) range4 GT EQ EQ foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];5658 -> 6137[label="",style="solid", color="black", weight=3];
5659[label="(++) range4 GT GT EQ foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];5659 -> 6138[label="",style="solid", color="black", weight=3];
5660[label="(++) range00 True (not (compare3 False True == LT) && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];5660 -> 6139[label="",style="solid", color="black", weight=3];
5661[label="(++) range00 True (not (compare3 False True == LT) && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];5661 -> 6140[label="",style="solid", color="black", weight=3];
5662[label="(++) range0 True False True foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];5662 -> 6141[label="",style="solid", color="black", weight=3];
5663[label="(++) range0 True True True foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];5663 -> 6142[label="",style="solid", color="black", weight=3];
9477[label="index4 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) otherwise",fontsize=16,color="black",shape="box"];9477 -> 9576[label="",style="solid", color="black", weight=3];
9478[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (compare (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) /= GT)",fontsize=16,color="black",shape="box"];9478 -> 9577[label="",style="solid", color="black", weight=3];
8055[label="zx67000",fontsize=16,color="green",shape="box"];8056[label="Succ zx67000",fontsize=16,color="green",shape="box"];8054[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx556))) (Integer (Pos (Succ zx556))) (not (primCmpNat zx557 zx557 == GT))",fontsize=16,color="burlywood",shape="triangle"];11905[label="zx557/Succ zx5570",fontsize=10,color="white",style="solid",shape="box"];8054 -> 11905[label="",style="solid", color="burlywood", weight=9];
11905 -> 8070[label="",style="solid", color="burlywood", weight=3];
11906[label="zx557/Zero",fontsize=10,color="white",style="solid",shape="box"];8054 -> 11906[label="",style="solid", color="burlywood", weight=9];
11906 -> 8071[label="",style="solid", color="burlywood", weight=3];
5675[label="index5 (Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];5675 -> 6155[label="",style="solid", color="black", weight=3];
5676[label="index5 (Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];5676 -> 6156[label="",style="solid", color="black", weight=3];
7855[label="index5 (Integer (Neg (Succ zx531))) (Integer (Pos (Succ zx532))) (Integer (Pos (Succ zx532))) (not (primCmpNat (Succ zx5330) (Succ zx5330) == GT))",fontsize=16,color="black",shape="box"];7855 -> 7875[label="",style="solid", color="black", weight=3];
7856[label="index5 (Integer (Neg (Succ zx531))) (Integer (Pos (Succ zx532))) (Integer (Pos (Succ zx532))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];7856 -> 7876[label="",style="solid", color="black", weight=3];
5679[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Pos Zero)) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];5679 -> 6159[label="",style="solid", color="black", weight=3];
9574[label="index4 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) otherwise",fontsize=16,color="black",shape="box"];9574 -> 9596[label="",style="solid", color="black", weight=3];
9575[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (compare (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) /= GT)",fontsize=16,color="black",shape="box"];9575 -> 9597[label="",style="solid", color="black", weight=3];
5690[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) (not False)",fontsize=16,color="black",shape="box"];5690 -> 6170[label="",style="solid", color="black", weight=3];
8249[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx568))) (Integer (Pos (Succ zx568))) (not (primCmpNat (Succ zx5690) (Succ zx5690) == GT))",fontsize=16,color="black",shape="box"];8249 -> 8259[label="",style="solid", color="black", weight=3];
8250[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx568))) (Integer (Pos (Succ zx568))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];8250 -> 8260[label="",style="solid", color="black", weight=3];
5693[label="index5 (Integer (Neg Zero)) (Integer (Pos Zero)) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];5693 -> 6173[label="",style="solid", color="black", weight=3];
5694[label="index5 (Integer (Neg Zero)) (Integer (Neg Zero)) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];5694 -> 6174[label="",style="solid", color="black", weight=3];
9259 -> 2397[label="",style="dashed", color="red", weight=0];
9259[label="error []",fontsize=16,color="magenta"];9260[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpInt (Pos (Succ zx627)) (Pos (Succ zx627)) == GT))",fontsize=16,color="black",shape="box"];9260 -> 9317[label="",style="solid", color="black", weight=3];
7763 -> 7723[label="",style="dashed", color="red", weight=0];
7763[label="index12 (Pos Zero) (Pos (Succ zx525)) (Pos (Succ zx525)) (not (primCmpNat zx5260 zx5260 == GT))",fontsize=16,color="magenta"];7763 -> 7858[label="",style="dashed", color="magenta", weight=3];
7764[label="index12 (Pos Zero) (Pos (Succ zx525)) (Pos (Succ zx525)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];7764 -> 7859[label="",style="solid", color="black", weight=3];
5707[label="Pos Zero",fontsize=16,color="green",shape="box"];5708[label="Pos Zero",fontsize=16,color="green",shape="box"];5709[label="Pos Zero",fontsize=16,color="green",shape="box"];5710[label="Neg Zero",fontsize=16,color="green",shape="box"];7562[label="zx5060",fontsize=16,color="green",shape="box"];7563[label="index12 (Neg (Succ zx504)) (Pos (Succ zx505)) (Pos (Succ zx505)) (not False)",fontsize=16,color="black",shape="box"];7563 -> 7644[label="",style="solid", color="black", weight=3];
5714[label="Neg (Succ zx6400)",fontsize=16,color="green",shape="box"];5715[label="Pos Zero",fontsize=16,color="green",shape="box"];9315 -> 2397[label="",style="dashed", color="red", weight=0];
9315[label="error []",fontsize=16,color="magenta"];9316[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpInt (Neg (Succ zx632)) (Neg (Succ zx632)) == GT))",fontsize=16,color="black",shape="box"];9316 -> 9367[label="",style="solid", color="black", weight=3];
5726 -> 3767[label="",style="dashed", color="red", weight=0];
5726[label="Neg Zero - Neg (Succ zx6400)",fontsize=16,color="magenta"];5726 -> 6205[label="",style="dashed", color="magenta", weight=3];
5726 -> 6206[label="",style="dashed", color="magenta", weight=3];
8013[label="zx5450",fontsize=16,color="green",shape="box"];8014[label="index12 (Neg Zero) (Pos (Succ zx544)) (Pos (Succ zx544)) (not False)",fontsize=16,color="black",shape="box"];8014 -> 8025[label="",style="solid", color="black", weight=3];
5730[label="Neg Zero",fontsize=16,color="green",shape="box"];5731[label="Pos Zero",fontsize=16,color="green",shape="box"];5732[label="Neg Zero",fontsize=16,color="green",shape="box"];5733[label="Neg Zero",fontsize=16,color="green",shape="box"];5735 -> 110[label="",style="dashed", color="red", weight=0];
5735[label="range (LT,LT)",fontsize=16,color="magenta"];5735 -> 6210[label="",style="dashed", color="magenta", weight=3];
5735 -> 6211[label="",style="dashed", color="magenta", weight=3];
5734[label="sum (map (index1 LT) zx360)",fontsize=16,color="black",shape="triangle"];5734 -> 6212[label="",style="solid", color="black", weight=3];
5744[label="index3 LT EQ False",fontsize=16,color="black",shape="box"];5744 -> 6213[label="",style="solid", color="black", weight=3];
5745[label="index3 LT GT False",fontsize=16,color="black",shape="box"];5745 -> 6214[label="",style="solid", color="black", weight=3];
5746[label="index3 EQ LT (not (GT == LT))",fontsize=16,color="black",shape="box"];5746 -> 6215[label="",style="solid", color="black", weight=3];
5748 -> 110[label="",style="dashed", color="red", weight=0];
5748[label="range (EQ,EQ)",fontsize=16,color="magenta"];5748 -> 6216[label="",style="dashed", color="magenta", weight=3];
5748 -> 6217[label="",style="dashed", color="magenta", weight=3];
5747[label="sum (map (index1 EQ) zx361)",fontsize=16,color="black",shape="triangle"];5747 -> 6218[label="",style="solid", color="black", weight=3];
5757[label="index3 EQ GT False",fontsize=16,color="black",shape="box"];5757 -> 6219[label="",style="solid", color="black", weight=3];
5758[label="index3 GT LT (not (GT == LT))",fontsize=16,color="black",shape="box"];5758 -> 6220[label="",style="solid", color="black", weight=3];
5759[label="index3 GT EQ (not (GT == LT))",fontsize=16,color="black",shape="box"];5759 -> 6221[label="",style="solid", color="black", weight=3];
5761 -> 110[label="",style="dashed", color="red", weight=0];
5761[label="range (GT,GT)",fontsize=16,color="magenta"];5761 -> 6222[label="",style="dashed", color="magenta", weight=3];
5761 -> 6223[label="",style="dashed", color="magenta", weight=3];
5760[label="sum (map (index1 GT) zx362)",fontsize=16,color="black",shape="triangle"];5760 -> 6224[label="",style="solid", color="black", weight=3];
5782 -> 111[label="",style="dashed", color="red", weight=0];
5782[label="range (False,False)",fontsize=16,color="magenta"];5782 -> 6225[label="",style="dashed", color="magenta", weight=3];
5782 -> 6226[label="",style="dashed", color="magenta", weight=3];
5781[label="sum (map (index0 False) zx364)",fontsize=16,color="black",shape="triangle"];5781 -> 6227[label="",style="solid", color="black", weight=3];
5853[label="index2 False True False",fontsize=16,color="black",shape="box"];5853 -> 6228[label="",style="solid", color="black", weight=3];
5854[label="index2 True False (not (GT == LT))",fontsize=16,color="black",shape="box"];5854 -> 6229[label="",style="solid", color="black", weight=3];
5856 -> 111[label="",style="dashed", color="red", weight=0];
5856[label="range (True,True)",fontsize=16,color="magenta"];5856 -> 6230[label="",style="dashed", color="magenta", weight=3];
5856 -> 6231[label="",style="dashed", color="magenta", weight=3];
5855[label="sum (map (index0 True) zx378)",fontsize=16,color="black",shape="triangle"];5855 -> 6232[label="",style="solid", color="black", weight=3];
6082[label="rangeSize1 EQ LT (null ((++) range40 EQ False foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6082 -> 6379[label="",style="solid", color="black", weight=3];
6083[label="rangeSize1 GT LT (null ((++) range40 EQ False foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6083 -> 6380[label="",style="solid", color="black", weight=3];
6084[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not False && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6084 -> 6381[label="",style="solid", color="black", weight=3];
7084[label="(++) range40 EQ (not (compare2 EQ EQ True == LT) && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];7084 -> 7225[label="",style="solid", color="black", weight=3];
6086[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare1 GT EQ False == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6086 -> 6383[label="",style="solid", color="black", weight=3];
6087[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare1 GT EQ False == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6087 -> 6384[label="",style="solid", color="black", weight=3];
6088[label="rangeSize1 True False (null ((++) range00 True False foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];6088 -> 6385[label="",style="solid", color="black", weight=3];
6089[label="rangeSize1 True True (null ((++) range00 True (not False && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];6089 -> 6386[label="",style="solid", color="black", weight=3];
6130[label="(++) range40 EQ (not (compare2 LT EQ (LT == EQ) == LT) && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];6130 -> 6422[label="",style="solid", color="black", weight=3];
6131[label="(++) range40 EQ (not (compare2 LT EQ (LT == EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6131 -> 6423[label="",style="solid", color="black", weight=3];
6132[label="(++) range40 EQ (not (compare2 LT EQ (LT == EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];6132 -> 6424[label="",style="solid", color="black", weight=3];
6133[label="(++) range40 EQ (EQ >= EQ && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];6133 -> 6425[label="",style="solid", color="black", weight=3];
6134[label="(++) range40 EQ (EQ >= EQ && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];6134 -> 6426[label="",style="solid", color="black", weight=3];
6136[label="(++) range40 EQ (GT >= EQ && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];6136 -> 6428[label="",style="solid", color="black", weight=3];
6137[label="(++) range40 EQ (GT >= EQ && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6137 -> 6429[label="",style="solid", color="black", weight=3];
6138[label="(++) range40 EQ (GT >= EQ && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];6138 -> 6430[label="",style="solid", color="black", weight=3];
6139[label="(++) range00 True (not (compare2 False True (False == True) == LT) && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];6139 -> 6431[label="",style="solid", color="black", weight=3];
6140[label="(++) range00 True (not (compare2 False True (False == True) == LT) && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];6140 -> 6432[label="",style="solid", color="black", weight=3];
6141[label="(++) range00 True (True >= True && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];6141 -> 6433[label="",style="solid", color="black", weight=3];
6142[label="(++) range00 True (True >= True && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];6142 -> 6434[label="",style="solid", color="black", weight=3];
9576[label="index4 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) True",fontsize=16,color="black",shape="box"];9576 -> 9598[label="",style="solid", color="black", weight=3];
9577[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (compare (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) == GT))",fontsize=16,color="black",shape="box"];9577 -> 9599[label="",style="solid", color="black", weight=3];
8070[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx556))) (Integer (Pos (Succ zx556))) (not (primCmpNat (Succ zx5570) (Succ zx5570) == GT))",fontsize=16,color="black",shape="box"];8070 -> 8095[label="",style="solid", color="black", weight=3];
8071[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx556))) (Integer (Pos (Succ zx556))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];8071 -> 8096[label="",style="solid", color="black", weight=3];
6155[label="fromInteger (Integer (Pos Zero) - Integer (Pos Zero))",fontsize=16,color="black",shape="box"];6155 -> 6447[label="",style="solid", color="black", weight=3];
6156[label="fromInteger (Integer (Neg Zero) - Integer (Pos Zero))",fontsize=16,color="black",shape="box"];6156 -> 6448[label="",style="solid", color="black", weight=3];
7875 -> 7832[label="",style="dashed", color="red", weight=0];
7875[label="index5 (Integer (Neg (Succ zx531))) (Integer (Pos (Succ zx532))) (Integer (Pos (Succ zx532))) (not (primCmpNat zx5330 zx5330 == GT))",fontsize=16,color="magenta"];7875 -> 7891[label="",style="dashed", color="magenta", weight=3];
7876[label="index5 (Integer (Neg (Succ zx531))) (Integer (Pos (Succ zx532))) (Integer (Pos (Succ zx532))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];7876 -> 7892[label="",style="solid", color="black", weight=3];
6159[label="fromInteger (Integer (Pos Zero) - Integer (Neg (Succ zx64000)))",fontsize=16,color="black",shape="box"];6159 -> 6452[label="",style="solid", color="black", weight=3];
9596[label="index4 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) True",fontsize=16,color="black",shape="box"];9596 -> 9706[label="",style="solid", color="black", weight=3];
9597[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (compare (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) == GT))",fontsize=16,color="black",shape="box"];9597 -> 9707[label="",style="solid", color="black", weight=3];
6170[label="index5 (Integer (Neg (Succ zx64000))) (Integer (Neg Zero)) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];6170 -> 6463[label="",style="solid", color="black", weight=3];
8259 -> 8230[label="",style="dashed", color="red", weight=0];
8259[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx568))) (Integer (Pos (Succ zx568))) (not (primCmpNat zx5690 zx5690 == GT))",fontsize=16,color="magenta"];8259 -> 8266[label="",style="dashed", color="magenta", weight=3];
8260[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx568))) (Integer (Pos (Succ zx568))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];8260 -> 8267[label="",style="solid", color="black", weight=3];
6173[label="fromInteger (Integer (Pos Zero) - Integer (Neg Zero))",fontsize=16,color="black",shape="box"];6173 -> 6467[label="",style="solid", color="black", weight=3];
6174[label="fromInteger (Integer (Neg Zero) - Integer (Neg Zero))",fontsize=16,color="black",shape="box"];6174 -> 6468[label="",style="solid", color="black", weight=3];
9317 -> 10366[label="",style="dashed", color="red", weight=0];
9317[label="index12 (Pos (Succ zx626)) (Pos (Succ zx627)) (Pos (Succ zx627)) (not (primCmpNat (Succ zx627) (Succ zx627) == GT))",fontsize=16,color="magenta"];9317 -> 10367[label="",style="dashed", color="magenta", weight=3];
9317 -> 10368[label="",style="dashed", color="magenta", weight=3];
9317 -> 10369[label="",style="dashed", color="magenta", weight=3];
7858[label="zx5260",fontsize=16,color="green",shape="box"];7859[label="index12 (Pos Zero) (Pos (Succ zx525)) (Pos (Succ zx525)) (not False)",fontsize=16,color="black",shape="box"];7859 -> 7877[label="",style="solid", color="black", weight=3];
7644[label="index12 (Neg (Succ zx504)) (Pos (Succ zx505)) (Pos (Succ zx505)) True",fontsize=16,color="black",shape="box"];7644 -> 7666[label="",style="solid", color="black", weight=3];
9367 -> 10410[label="",style="dashed", color="red", weight=0];
9367[label="index12 (Neg (Succ zx631)) (Neg (Succ zx632)) (Neg (Succ zx632)) (not (primCmpNat (Succ zx632) (Succ zx632) == GT))",fontsize=16,color="magenta"];9367 -> 10411[label="",style="dashed", color="magenta", weight=3];
9367 -> 10412[label="",style="dashed", color="magenta", weight=3];
9367 -> 10413[label="",style="dashed", color="magenta", weight=3];
6205[label="Neg (Succ zx6400)",fontsize=16,color="green",shape="box"];6206[label="Neg Zero",fontsize=16,color="green",shape="box"];8025[label="index12 (Neg Zero) (Pos (Succ zx544)) (Pos (Succ zx544)) True",fontsize=16,color="black",shape="box"];8025 -> 8038[label="",style="solid", color="black", weight=3];
6210[label="LT",fontsize=16,color="green",shape="box"];6211[label="LT",fontsize=16,color="green",shape="box"];6212[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 LT) zx360)",fontsize=16,color="burlywood",shape="box"];11920[label="zx360/zx3600 : zx3601",fontsize=10,color="white",style="solid",shape="box"];6212 -> 11920[label="",style="solid", color="burlywood", weight=9];
11920 -> 6504[label="",style="solid", color="burlywood", weight=3];
11921[label="zx360/[]",fontsize=10,color="white",style="solid",shape="box"];6212 -> 11921[label="",style="solid", color="burlywood", weight=9];
11921 -> 6505[label="",style="solid", color="burlywood", weight=3];
6213 -> 2397[label="",style="dashed", color="red", weight=0];
6213[label="error []",fontsize=16,color="magenta"];6214 -> 2397[label="",style="dashed", color="red", weight=0];
6214[label="error []",fontsize=16,color="magenta"];6215[label="index3 EQ LT (not False)",fontsize=16,color="black",shape="box"];6215 -> 6506[label="",style="solid", color="black", weight=3];
6216[label="EQ",fontsize=16,color="green",shape="box"];6217[label="EQ",fontsize=16,color="green",shape="box"];6218[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 EQ) zx361)",fontsize=16,color="burlywood",shape="box"];11924[label="zx361/zx3610 : zx3611",fontsize=10,color="white",style="solid",shape="box"];6218 -> 11924[label="",style="solid", color="burlywood", weight=9];
11924 -> 6507[label="",style="solid", color="burlywood", weight=3];
11925[label="zx361/[]",fontsize=10,color="white",style="solid",shape="box"];6218 -> 11925[label="",style="solid", color="burlywood", weight=9];
11925 -> 6508[label="",style="solid", color="burlywood", weight=3];
6219 -> 2397[label="",style="dashed", color="red", weight=0];
6219[label="error []",fontsize=16,color="magenta"];6220[label="index3 GT LT (not False)",fontsize=16,color="black",shape="box"];6220 -> 6509[label="",style="solid", color="black", weight=3];
6221[label="index3 GT EQ (not False)",fontsize=16,color="black",shape="box"];6221 -> 6510[label="",style="solid", color="black", weight=3];
6222[label="GT",fontsize=16,color="green",shape="box"];6223[label="GT",fontsize=16,color="green",shape="box"];6224[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 GT) zx362)",fontsize=16,color="burlywood",shape="box"];11927[label="zx362/zx3620 : zx3621",fontsize=10,color="white",style="solid",shape="box"];6224 -> 11927[label="",style="solid", color="burlywood", weight=9];
11927 -> 6511[label="",style="solid", color="burlywood", weight=3];
11928[label="zx362/[]",fontsize=10,color="white",style="solid",shape="box"];6224 -> 11928[label="",style="solid", color="burlywood", weight=9];
11928 -> 6512[label="",style="solid", color="burlywood", weight=3];
6225[label="False",fontsize=16,color="green",shape="box"];6226[label="False",fontsize=16,color="green",shape="box"];6227[label="foldl' (+) (fromInt (Pos Zero)) (map (index0 False) zx364)",fontsize=16,color="burlywood",shape="box"];11929[label="zx364/zx3640 : zx3641",fontsize=10,color="white",style="solid",shape="box"];6227 -> 11929[label="",style="solid", color="burlywood", weight=9];
11929 -> 6513[label="",style="solid", color="burlywood", weight=3];
11930[label="zx364/[]",fontsize=10,color="white",style="solid",shape="box"];6227 -> 11930[label="",style="solid", color="burlywood", weight=9];
11930 -> 6514[label="",style="solid", color="burlywood", weight=3];
6228 -> 2397[label="",style="dashed", color="red", weight=0];
6228[label="error []",fontsize=16,color="magenta"];6229[label="index2 True False (not False)",fontsize=16,color="black",shape="box"];6229 -> 6515[label="",style="solid", color="black", weight=3];
6230[label="True",fontsize=16,color="green",shape="box"];6231[label="True",fontsize=16,color="green",shape="box"];6232[label="foldl' (+) (fromInt (Pos Zero)) (map (index0 True) zx378)",fontsize=16,color="burlywood",shape="box"];11932[label="zx378/zx3780 : zx3781",fontsize=10,color="white",style="solid",shape="box"];6232 -> 11932[label="",style="solid", color="burlywood", weight=9];
11932 -> 6516[label="",style="solid", color="burlywood", weight=3];
11933[label="zx378/[]",fontsize=10,color="white",style="solid",shape="box"];6232 -> 11933[label="",style="solid", color="burlywood", weight=9];
11933 -> 6517[label="",style="solid", color="burlywood", weight=3];
6379[label="rangeSize1 EQ LT (null ((++) [] foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6379 -> 6575[label="",style="solid", color="black", weight=3];
6380[label="rangeSize1 GT LT (null ((++) [] foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6380 -> 6576[label="",style="solid", color="black", weight=3];
6381[label="rangeSize1 EQ EQ (null ((++) range40 EQ (True && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6381 -> 6577[label="",style="solid", color="black", weight=3];
7225[label="(++) range40 EQ (not (EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];7225 -> 7398[label="",style="solid", color="black", weight=3];
6383[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare0 GT EQ otherwise == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6383 -> 6579[label="",style="solid", color="black", weight=3];
6384[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare0 GT EQ otherwise == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6384 -> 6580[label="",style="solid", color="black", weight=3];
6385[label="rangeSize1 True False (null ((++) [] foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];6385 -> 6581[label="",style="solid", color="black", weight=3];
6386[label="rangeSize1 True True (null ((++) range00 True (True && True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];6386 -> 6582[label="",style="solid", color="black", weight=3];
6422[label="(++) range40 EQ (not (compare2 LT EQ False == LT) && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];6422 -> 6606[label="",style="solid", color="black", weight=3];
6423[label="(++) range40 EQ (not (compare2 LT EQ False == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6423 -> 6607[label="",style="solid", color="black", weight=3];
6424[label="(++) range40 EQ (not (compare2 LT EQ False == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];6424 -> 6608[label="",style="solid", color="black", weight=3];
6425[label="(++) range40 EQ (compare EQ EQ /= LT && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];6425 -> 6609[label="",style="solid", color="black", weight=3];
6426[label="(++) range40 EQ (compare EQ EQ /= LT && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];6426 -> 6610[label="",style="solid", color="black", weight=3];
6428[label="(++) range40 EQ (compare GT EQ /= LT && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];6428 -> 6612[label="",style="solid", color="black", weight=3];
6429[label="(++) range40 EQ (compare GT EQ /= LT && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6429 -> 6613[label="",style="solid", color="black", weight=3];
6430[label="(++) range40 EQ (compare GT EQ /= LT && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];6430 -> 6614[label="",style="solid", color="black", weight=3];
6431[label="(++) range00 True (not (compare2 False True False == LT) && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];6431 -> 6615[label="",style="solid", color="black", weight=3];
6432[label="(++) range00 True (not (compare2 False True False == LT) && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];6432 -> 6616[label="",style="solid", color="black", weight=3];
6433[label="(++) range00 True (compare True True /= LT && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];6433 -> 6617[label="",style="solid", color="black", weight=3];
6434[label="(++) range00 True (compare True True /= LT && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];6434 -> 6618[label="",style="solid", color="black", weight=3];
9598 -> 2397[label="",style="dashed", color="red", weight=0];
9598[label="error []",fontsize=16,color="magenta"];9599[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpInt (Pos (Succ zx653)) (Pos (Succ zx653)) == GT))",fontsize=16,color="black",shape="box"];9599 -> 9708[label="",style="solid", color="black", weight=3];
8095 -> 8054[label="",style="dashed", color="red", weight=0];
8095[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx556))) (Integer (Pos (Succ zx556))) (not (primCmpNat zx5570 zx5570 == GT))",fontsize=16,color="magenta"];8095 -> 8143[label="",style="dashed", color="magenta", weight=3];
8096[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx556))) (Integer (Pos (Succ zx556))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];8096 -> 8144[label="",style="solid", color="black", weight=3];
6447 -> 6634[label="",style="dashed", color="red", weight=0];
6447[label="fromInteger (Integer (primMinusInt (Pos Zero) (Pos Zero)))",fontsize=16,color="magenta"];6447 -> 6635[label="",style="dashed", color="magenta", weight=3];
6448 -> 6634[label="",style="dashed", color="red", weight=0];
6448[label="fromInteger (Integer (primMinusInt (Neg Zero) (Pos Zero)))",fontsize=16,color="magenta"];6448 -> 6636[label="",style="dashed", color="magenta", weight=3];
7891[label="zx5330",fontsize=16,color="green",shape="box"];7892[label="index5 (Integer (Neg (Succ zx531))) (Integer (Pos (Succ zx532))) (Integer (Pos (Succ zx532))) (not False)",fontsize=16,color="black",shape="box"];7892 -> 7905[label="",style="solid", color="black", weight=3];
6452 -> 6634[label="",style="dashed", color="red", weight=0];
6452[label="fromInteger (Integer (primMinusInt (Pos Zero) (Neg (Succ zx64000))))",fontsize=16,color="magenta"];6452 -> 6637[label="",style="dashed", color="magenta", weight=3];
9706 -> 2397[label="",style="dashed", color="red", weight=0];
9706[label="error []",fontsize=16,color="magenta"];9707[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpInt (Neg (Succ zx658)) (Neg (Succ zx658)) == GT))",fontsize=16,color="black",shape="box"];9707 -> 9729[label="",style="solid", color="black", weight=3];
6463[label="fromInteger (Integer (Neg Zero) - Integer (Neg (Succ zx64000)))",fontsize=16,color="black",shape="box"];6463 -> 6664[label="",style="solid", color="black", weight=3];
8266[label="zx5690",fontsize=16,color="green",shape="box"];8267[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx568))) (Integer (Pos (Succ zx568))) (not False)",fontsize=16,color="black",shape="box"];8267 -> 8273[label="",style="solid", color="black", weight=3];
6467 -> 6634[label="",style="dashed", color="red", weight=0];
6467[label="fromInteger (Integer (primMinusInt (Pos Zero) (Neg Zero)))",fontsize=16,color="magenta"];6467 -> 6638[label="",style="dashed", color="magenta", weight=3];
6468 -> 6634[label="",style="dashed", color="red", weight=0];
6468[label="fromInteger (Integer (primMinusInt (Neg Zero) (Neg Zero)))",fontsize=16,color="magenta"];6468 -> 6639[label="",style="dashed", color="magenta", weight=3];
10367[label="zx627",fontsize=16,color="green",shape="box"];10368[label="zx626",fontsize=16,color="green",shape="box"];10369[label="Succ zx627",fontsize=16,color="green",shape="box"];10366[label="index12 (Pos (Succ zx700)) (Pos (Succ zx701)) (Pos (Succ zx701)) (not (primCmpNat zx702 zx702 == GT))",fontsize=16,color="burlywood",shape="triangle"];11942[label="zx702/Succ zx7020",fontsize=10,color="white",style="solid",shape="box"];10366 -> 11942[label="",style="solid", color="burlywood", weight=9];
11942 -> 10397[label="",style="solid", color="burlywood", weight=3];
11943[label="zx702/Zero",fontsize=10,color="white",style="solid",shape="box"];10366 -> 11943[label="",style="solid", color="burlywood", weight=9];
11943 -> 10398[label="",style="solid", color="burlywood", weight=3];
7877[label="index12 (Pos Zero) (Pos (Succ zx525)) (Pos (Succ zx525)) True",fontsize=16,color="black",shape="box"];7877 -> 7894[label="",style="solid", color="black", weight=3];
7666 -> 3767[label="",style="dashed", color="red", weight=0];
7666[label="Pos (Succ zx505) - Neg (Succ zx504)",fontsize=16,color="magenta"];7666 -> 7680[label="",style="dashed", color="magenta", weight=3];
7666 -> 7681[label="",style="dashed", color="magenta", weight=3];
10411[label="zx631",fontsize=16,color="green",shape="box"];10412[label="zx632",fontsize=16,color="green",shape="box"];10413[label="Succ zx632",fontsize=16,color="green",shape="box"];10410[label="index12 (Neg (Succ zx704)) (Neg (Succ zx705)) (Neg (Succ zx705)) (not (primCmpNat zx706 zx706 == GT))",fontsize=16,color="burlywood",shape="triangle"];11945[label="zx706/Succ zx7060",fontsize=10,color="white",style="solid",shape="box"];10410 -> 11945[label="",style="solid", color="burlywood", weight=9];
11945 -> 10441[label="",style="solid", color="burlywood", weight=3];
11946[label="zx706/Zero",fontsize=10,color="white",style="solid",shape="box"];10410 -> 11946[label="",style="solid", color="burlywood", weight=9];
11946 -> 10442[label="",style="solid", color="burlywood", weight=3];
8038 -> 3767[label="",style="dashed", color="red", weight=0];
8038[label="Pos (Succ zx544) - Neg Zero",fontsize=16,color="magenta"];8038 -> 8072[label="",style="dashed", color="magenta", weight=3];
8038 -> 8073[label="",style="dashed", color="magenta", weight=3];
6504[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 LT) (zx3600 : zx3601))",fontsize=16,color="black",shape="box"];6504 -> 6707[label="",style="solid", color="black", weight=3];
6505[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 LT) [])",fontsize=16,color="black",shape="box"];6505 -> 6708[label="",style="solid", color="black", weight=3];
6506[label="index3 EQ LT True",fontsize=16,color="black",shape="box"];6506 -> 6709[label="",style="solid", color="black", weight=3];
6507[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 EQ) (zx3610 : zx3611))",fontsize=16,color="black",shape="box"];6507 -> 6710[label="",style="solid", color="black", weight=3];
6508[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 EQ) [])",fontsize=16,color="black",shape="box"];6508 -> 6711[label="",style="solid", color="black", weight=3];
6509[label="index3 GT LT True",fontsize=16,color="black",shape="box"];6509 -> 6712[label="",style="solid", color="black", weight=3];
6510[label="index3 GT EQ True",fontsize=16,color="black",shape="box"];6510 -> 6713[label="",style="solid", color="black", weight=3];
6511[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 GT) (zx3620 : zx3621))",fontsize=16,color="black",shape="box"];6511 -> 6714[label="",style="solid", color="black", weight=3];
6512[label="foldl' (+) (fromInt (Pos Zero)) (map (index1 GT) [])",fontsize=16,color="black",shape="box"];6512 -> 6715[label="",style="solid", color="black", weight=3];
6513[label="foldl' (+) (fromInt (Pos Zero)) (map (index0 False) (zx3640 : zx3641))",fontsize=16,color="black",shape="box"];6513 -> 6716[label="",style="solid", color="black", weight=3];
6514[label="foldl' (+) (fromInt (Pos Zero)) (map (index0 False) [])",fontsize=16,color="black",shape="box"];6514 -> 6717[label="",style="solid", color="black", weight=3];
6515[label="index2 True False True",fontsize=16,color="black",shape="box"];6515 -> 6718[label="",style="solid", color="black", weight=3];
6516[label="foldl' (+) (fromInt (Pos Zero)) (map (index0 True) (zx3780 : zx3781))",fontsize=16,color="black",shape="box"];6516 -> 6719[label="",style="solid", color="black", weight=3];
6517[label="foldl' (+) (fromInt (Pos Zero)) (map (index0 True) [])",fontsize=16,color="black",shape="box"];6517 -> 6720[label="",style="solid", color="black", weight=3];
6575[label="rangeSize1 EQ LT (null (foldr (++) [] (map (range4 LT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6575 -> 6721[label="",style="solid", color="black", weight=3];
6576[label="rangeSize1 GT LT (null (foldr (++) [] (map (range4 LT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6576 -> 6722[label="",style="solid", color="black", weight=3];
6577[label="rangeSize1 EQ EQ (null ((++) range40 EQ (EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6577 -> 6723[label="",style="solid", color="black", weight=3];
7398[label="(++) range40 EQ (not False && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];7398 -> 7584[label="",style="solid", color="black", weight=3];
6579[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare0 GT EQ True == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6579 -> 6725[label="",style="solid", color="black", weight=3];
6580[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare0 GT EQ True == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6580 -> 6726[label="",style="solid", color="black", weight=3];
6581[label="rangeSize1 True False (null (foldr (++) [] (map (range0 False True) [])))",fontsize=16,color="black",shape="box"];6581 -> 6727[label="",style="solid", color="black", weight=3];
6582[label="rangeSize1 True True (null ((++) range00 True (True >= True) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];6582 -> 6728[label="",style="solid", color="black", weight=3];
6606[label="(++) range40 EQ (not (compare1 LT EQ (LT <= EQ) == LT) && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];6606 -> 6761[label="",style="solid", color="black", weight=3];
6607[label="(++) range40 EQ (not (compare1 LT EQ (LT <= EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6607 -> 6762[label="",style="solid", color="black", weight=3];
6608[label="(++) range40 EQ (not (compare1 LT EQ (LT <= EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];6608 -> 6763[label="",style="solid", color="black", weight=3];
6609[label="(++) range40 EQ (not (compare EQ EQ == LT) && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];6609 -> 6764[label="",style="solid", color="black", weight=3];
6610[label="(++) range40 EQ (not (compare EQ EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];6610 -> 6765[label="",style="solid", color="black", weight=3];
6612[label="(++) range40 EQ (not (compare GT EQ == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];6612 -> 6767[label="",style="solid", color="black", weight=3];
6613[label="(++) range40 EQ (not (compare GT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6613 -> 6768[label="",style="solid", color="black", weight=3];
6614[label="(++) range40 EQ (not (compare GT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];6614 -> 6769[label="",style="solid", color="black", weight=3];
6615[label="(++) range00 True (not (compare1 False True (False <= True) == LT) && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];6615 -> 6770[label="",style="solid", color="black", weight=3];
6616[label="(++) range00 True (not (compare1 False True (False <= True) == LT) && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];6616 -> 6771[label="",style="solid", color="black", weight=3];
6617[label="(++) range00 True (not (compare True True == LT) && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];6617 -> 6772[label="",style="solid", color="black", weight=3];
6618[label="(++) range00 True (not (compare True True == LT) && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];6618 -> 6773[label="",style="solid", color="black", weight=3];
9708 -> 10259[label="",style="dashed", color="red", weight=0];
9708[label="index5 (Integer (Pos (Succ zx652))) (Integer (Pos (Succ zx653))) (Integer (Pos (Succ zx653))) (not (primCmpNat (Succ zx653) (Succ zx653) == GT))",fontsize=16,color="magenta"];9708 -> 10260[label="",style="dashed", color="magenta", weight=3];
9708 -> 10261[label="",style="dashed", color="magenta", weight=3];
9708 -> 10262[label="",style="dashed", color="magenta", weight=3];
8143[label="zx5570",fontsize=16,color="green",shape="box"];8144[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx556))) (Integer (Pos (Succ zx556))) (not False)",fontsize=16,color="black",shape="box"];8144 -> 8206[label="",style="solid", color="black", weight=3];
6635 -> 3992[label="",style="dashed", color="red", weight=0];
6635[label="primMinusInt (Pos Zero) (Pos Zero)",fontsize=16,color="magenta"];6635 -> 6789[label="",style="dashed", color="magenta", weight=3];
6635 -> 6790[label="",style="dashed", color="magenta", weight=3];
6634[label="fromInteger (Integer zx450)",fontsize=16,color="black",shape="triangle"];6634 -> 6791[label="",style="solid", color="black", weight=3];
6636 -> 3992[label="",style="dashed", color="red", weight=0];
6636[label="primMinusInt (Neg Zero) (Pos Zero)",fontsize=16,color="magenta"];6636 -> 6792[label="",style="dashed", color="magenta", weight=3];
6636 -> 6793[label="",style="dashed", color="magenta", weight=3];
7905[label="index5 (Integer (Neg (Succ zx531))) (Integer (Pos (Succ zx532))) (Integer (Pos (Succ zx532))) True",fontsize=16,color="black",shape="box"];7905 -> 7915[label="",style="solid", color="black", weight=3];
6637 -> 3992[label="",style="dashed", color="red", weight=0];
6637[label="primMinusInt (Pos Zero) (Neg (Succ zx64000))",fontsize=16,color="magenta"];6637 -> 6798[label="",style="dashed", color="magenta", weight=3];
6637 -> 6799[label="",style="dashed", color="magenta", weight=3];
9729 -> 10519[label="",style="dashed", color="red", weight=0];
9729[label="index5 (Integer (Neg (Succ zx657))) (Integer (Neg (Succ zx658))) (Integer (Neg (Succ zx658))) (not (primCmpNat (Succ zx658) (Succ zx658) == GT))",fontsize=16,color="magenta"];9729 -> 10520[label="",style="dashed", color="magenta", weight=3];
9729 -> 10521[label="",style="dashed", color="magenta", weight=3];
9729 -> 10522[label="",style="dashed", color="magenta", weight=3];
6664 -> 6634[label="",style="dashed", color="red", weight=0];
6664[label="fromInteger (Integer (primMinusInt (Neg Zero) (Neg (Succ zx64000))))",fontsize=16,color="magenta"];6664 -> 6812[label="",style="dashed", color="magenta", weight=3];
8273[label="index5 (Integer (Neg Zero)) (Integer (Pos (Succ zx568))) (Integer (Pos (Succ zx568))) True",fontsize=16,color="black",shape="box"];8273 -> 8303[label="",style="solid", color="black", weight=3];
6638 -> 3992[label="",style="dashed", color="red", weight=0];
6638[label="primMinusInt (Pos Zero) (Neg Zero)",fontsize=16,color="magenta"];6638 -> 6817[label="",style="dashed", color="magenta", weight=3];
6638 -> 6818[label="",style="dashed", color="magenta", weight=3];
6639 -> 3992[label="",style="dashed", color="red", weight=0];
6639[label="primMinusInt (Neg Zero) (Neg Zero)",fontsize=16,color="magenta"];6639 -> 6819[label="",style="dashed", color="magenta", weight=3];
6639 -> 6820[label="",style="dashed", color="magenta", weight=3];
10397[label="index12 (Pos (Succ zx700)) (Pos (Succ zx701)) (Pos (Succ zx701)) (not (primCmpNat (Succ zx7020) (Succ zx7020) == GT))",fontsize=16,color="black",shape="box"];10397 -> 10443[label="",style="solid", color="black", weight=3];
10398[label="index12 (Pos (Succ zx700)) (Pos (Succ zx701)) (Pos (Succ zx701)) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];10398 -> 10444[label="",style="solid", color="black", weight=3];
7894 -> 3767[label="",style="dashed", color="red", weight=0];
7894[label="Pos (Succ zx525) - Pos Zero",fontsize=16,color="magenta"];7894 -> 7907[label="",style="dashed", color="magenta", weight=3];
7894 -> 7908[label="",style="dashed", color="magenta", weight=3];
7680[label="Neg (Succ zx504)",fontsize=16,color="green",shape="box"];7681[label="Pos (Succ zx505)",fontsize=16,color="green",shape="box"];10441[label="index12 (Neg (Succ zx704)) (Neg (Succ zx705)) (Neg (Succ zx705)) (not (primCmpNat (Succ zx7060) (Succ zx7060) == GT))",fontsize=16,color="black",shape="box"];10441 -> 10479[label="",style="solid", color="black", weight=3];
10442[label="index12 (Neg (Succ zx704)) (Neg (Succ zx705)) (Neg (Succ zx705)) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];10442 -> 10480[label="",style="solid", color="black", weight=3];
8072[label="Neg Zero",fontsize=16,color="green",shape="box"];8073[label="Pos (Succ zx544)",fontsize=16,color="green",shape="box"];6707[label="foldl' (+) (fromInt (Pos Zero)) (index1 LT zx3600 : map (index1 LT) zx3601)",fontsize=16,color="black",shape="box"];6707 -> 6863[label="",style="solid", color="black", weight=3];
6708[label="foldl' (+) (fromInt (Pos Zero)) []",fontsize=16,color="black",shape="triangle"];6708 -> 6864[label="",style="solid", color="black", weight=3];
6709 -> 5747[label="",style="dashed", color="red", weight=0];
6709[label="sum (map (index1 EQ) (range (LT,EQ)))",fontsize=16,color="magenta"];6709 -> 6865[label="",style="dashed", color="magenta", weight=3];
6710[label="foldl' (+) (fromInt (Pos Zero)) (index1 EQ zx3610 : map (index1 EQ) zx3611)",fontsize=16,color="black",shape="box"];6710 -> 6866[label="",style="solid", color="black", weight=3];
6711 -> 6708[label="",style="dashed", color="red", weight=0];
6711[label="foldl' (+) (fromInt (Pos Zero)) []",fontsize=16,color="magenta"];6712 -> 5760[label="",style="dashed", color="red", weight=0];
6712[label="sum (map (index1 GT) (range (LT,GT)))",fontsize=16,color="magenta"];6712 -> 6867[label="",style="dashed", color="magenta", weight=3];
6713 -> 5760[label="",style="dashed", color="red", weight=0];
6713[label="sum (map (index1 GT) (range (EQ,GT)))",fontsize=16,color="magenta"];6713 -> 6868[label="",style="dashed", color="magenta", weight=3];
6714[label="foldl' (+) (fromInt (Pos Zero)) (index1 GT zx3620 : map (index1 GT) zx3621)",fontsize=16,color="black",shape="box"];6714 -> 6869[label="",style="solid", color="black", weight=3];
6715 -> 6708[label="",style="dashed", color="red", weight=0];
6715[label="foldl' (+) (fromInt (Pos Zero)) []",fontsize=16,color="magenta"];6716[label="foldl' (+) (fromInt (Pos Zero)) (index0 False zx3640 : map (index0 False) zx3641)",fontsize=16,color="black",shape="box"];6716 -> 6870[label="",style="solid", color="black", weight=3];
6717 -> 6708[label="",style="dashed", color="red", weight=0];
6717[label="foldl' (+) (fromInt (Pos Zero)) []",fontsize=16,color="magenta"];6718 -> 5855[label="",style="dashed", color="red", weight=0];
6718[label="sum (map (index0 True) (range (False,True)))",fontsize=16,color="magenta"];6718 -> 6871[label="",style="dashed", color="magenta", weight=3];
6719[label="foldl' (+) (fromInt (Pos Zero)) (index0 True zx3780 : map (index0 True) zx3781)",fontsize=16,color="black",shape="box"];6719 -> 6872[label="",style="solid", color="black", weight=3];
6720 -> 6708[label="",style="dashed", color="red", weight=0];
6720[label="foldl' (+) (fromInt (Pos Zero)) []",fontsize=16,color="magenta"];6721[label="rangeSize1 EQ LT (null (foldr (++) [] (range4 LT EQ GT : map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];6721 -> 6873[label="",style="solid", color="black", weight=3];
6722[label="rangeSize1 GT LT (null (foldr (++) [] (range4 LT GT GT : map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];6722 -> 6874[label="",style="solid", color="black", weight=3];
6723[label="rangeSize1 EQ EQ (null ((++) range40 EQ (compare EQ EQ /= LT) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6723 -> 6875[label="",style="solid", color="black", weight=3];
7584[label="(++) range40 EQ (True && EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];7584 -> 7797[label="",style="solid", color="black", weight=3];
6725[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (GT == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6725 -> 6877[label="",style="solid", color="black", weight=3];
6726[label="rangeSize1 GT GT (null ((++) range40 EQ (not (GT == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6726 -> 6878[label="",style="solid", color="black", weight=3];
6727[label="rangeSize1 True False (null (foldr (++) [] []))",fontsize=16,color="black",shape="box"];6727 -> 6879[label="",style="solid", color="black", weight=3];
6728[label="rangeSize1 True True (null ((++) range00 True (compare True True /= LT) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];6728 -> 6880[label="",style="solid", color="black", weight=3];
6761[label="(++) range40 EQ (not (compare1 LT EQ True == LT) && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];6761 -> 6895[label="",style="solid", color="black", weight=3];
6762[label="(++) range40 EQ (not (compare1 LT EQ True == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6762 -> 6896[label="",style="solid", color="black", weight=3];
6763[label="(++) range40 EQ (not (compare1 LT EQ True == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];6763 -> 6897[label="",style="solid", color="black", weight=3];
6764[label="(++) range40 EQ (not (compare3 EQ EQ == LT) && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];6764 -> 6898[label="",style="solid", color="black", weight=3];
6765[label="(++) range40 EQ (not (compare3 EQ EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];6765 -> 6899[label="",style="solid", color="black", weight=3];
6767[label="(++) range40 EQ (not (compare3 GT EQ == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];6767 -> 6901[label="",style="solid", color="black", weight=3];
6768[label="(++) range40 EQ (not (compare3 GT EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6768 -> 6902[label="",style="solid", color="black", weight=3];
6769[label="(++) range40 EQ (not (compare3 GT EQ == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];6769 -> 6903[label="",style="solid", color="black", weight=3];
6770[label="(++) range00 True (not (compare1 False True True == LT) && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];6770 -> 6904[label="",style="solid", color="black", weight=3];
6771[label="(++) range00 True (not (compare1 False True True == LT) && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];6771 -> 6905[label="",style="solid", color="black", weight=3];
6772[label="(++) range00 True (not (compare3 True True == LT) && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];6772 -> 6906[label="",style="solid", color="black", weight=3];
6773[label="(++) range00 True (not (compare3 True True == LT) && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];6773 -> 6907[label="",style="solid", color="black", weight=3];
10260[label="zx653",fontsize=16,color="green",shape="box"];10261[label="zx652",fontsize=16,color="green",shape="box"];10262[label="Succ zx653",fontsize=16,color="green",shape="box"];10259[label="index5 (Integer (Pos (Succ zx692))) (Integer (Pos (Succ zx693))) (Integer (Pos (Succ zx693))) (not (primCmpNat zx694 zx694 == GT))",fontsize=16,color="burlywood",shape="triangle"];11965[label="zx694/Succ zx6940",fontsize=10,color="white",style="solid",shape="box"];10259 -> 11965[label="",style="solid", color="burlywood", weight=9];
11965 -> 10281[label="",style="solid", color="burlywood", weight=3];
11966[label="zx694/Zero",fontsize=10,color="white",style="solid",shape="box"];10259 -> 11966[label="",style="solid", color="burlywood", weight=9];
11966 -> 10282[label="",style="solid", color="burlywood", weight=3];
8206[label="index5 (Integer (Pos Zero)) (Integer (Pos (Succ zx556))) (Integer (Pos (Succ zx556))) True",fontsize=16,color="black",shape="box"];8206 -> 8252[label="",style="solid", color="black", weight=3];
6789[label="Pos Zero",fontsize=16,color="green",shape="box"];6790[label="Pos Zero",fontsize=16,color="green",shape="box"];6791[label="zx450",fontsize=16,color="green",shape="box"];6792[label="Pos Zero",fontsize=16,color="green",shape="box"];6793[label="Neg Zero",fontsize=16,color="green",shape="box"];7915[label="fromInteger (Integer (Pos (Succ zx532)) - Integer (Neg (Succ zx531)))",fontsize=16,color="black",shape="box"];7915 -> 7964[label="",style="solid", color="black", weight=3];
6798[label="Neg (Succ zx64000)",fontsize=16,color="green",shape="box"];6799[label="Pos Zero",fontsize=16,color="green",shape="box"];10520[label="Succ zx658",fontsize=16,color="green",shape="box"];10521[label="zx658",fontsize=16,color="green",shape="box"];10522[label="zx657",fontsize=16,color="green",shape="box"];10519[label="index5 (Integer (Neg (Succ zx708))) (Integer (Neg (Succ zx709))) (Integer (Neg (Succ zx709))) (not (primCmpNat zx710 zx710 == GT))",fontsize=16,color="burlywood",shape="triangle"];11967[label="zx710/Succ zx7100",fontsize=10,color="white",style="solid",shape="box"];10519 -> 11967[label="",style="solid", color="burlywood", weight=9];
11967 -> 10550[label="",style="solid", color="burlywood", weight=3];
11968[label="zx710/Zero",fontsize=10,color="white",style="solid",shape="box"];10519 -> 11968[label="",style="solid", color="burlywood", weight=9];
11968 -> 10551[label="",style="solid", color="burlywood", weight=3];
6812 -> 3992[label="",style="dashed", color="red", weight=0];
6812[label="primMinusInt (Neg Zero) (Neg (Succ zx64000))",fontsize=16,color="magenta"];6812 -> 6941[label="",style="dashed", color="magenta", weight=3];
6812 -> 6942[label="",style="dashed", color="magenta", weight=3];
8303[label="fromInteger (Integer (Pos (Succ zx568)) - Integer (Neg Zero))",fontsize=16,color="black",shape="box"];8303 -> 8347[label="",style="solid", color="black", weight=3];
6817[label="Neg Zero",fontsize=16,color="green",shape="box"];6818[label="Pos Zero",fontsize=16,color="green",shape="box"];6819[label="Neg Zero",fontsize=16,color="green",shape="box"];6820[label="Neg Zero",fontsize=16,color="green",shape="box"];10443 -> 10366[label="",style="dashed", color="red", weight=0];
10443[label="index12 (Pos (Succ zx700)) (Pos (Succ zx701)) (Pos (Succ zx701)) (not (primCmpNat zx7020 zx7020 == GT))",fontsize=16,color="magenta"];10443 -> 10481[label="",style="dashed", color="magenta", weight=3];
10444[label="index12 (Pos (Succ zx700)) (Pos (Succ zx701)) (Pos (Succ zx701)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];10444 -> 10482[label="",style="solid", color="black", weight=3];
7907[label="Pos Zero",fontsize=16,color="green",shape="box"];7908[label="Pos (Succ zx525)",fontsize=16,color="green",shape="box"];10479 -> 10410[label="",style="dashed", color="red", weight=0];
10479[label="index12 (Neg (Succ zx704)) (Neg (Succ zx705)) (Neg (Succ zx705)) (not (primCmpNat zx7060 zx7060 == GT))",fontsize=16,color="magenta"];10479 -> 10512[label="",style="dashed", color="magenta", weight=3];
10480[label="index12 (Neg (Succ zx704)) (Neg (Succ zx705)) (Neg (Succ zx705)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];10480 -> 10513[label="",style="solid", color="black", weight=3];
6863[label="(foldl' (+) $! (+) fromInt (Pos Zero) index1 LT zx3600)",fontsize=16,color="black",shape="box"];6863 -> 6991[label="",style="solid", color="black", weight=3];
6864[label="fromInt (Pos Zero)",fontsize=16,color="black",shape="triangle"];6864 -> 6992[label="",style="solid", color="black", weight=3];
6865 -> 110[label="",style="dashed", color="red", weight=0];
6865[label="range (LT,EQ)",fontsize=16,color="magenta"];6865 -> 6993[label="",style="dashed", color="magenta", weight=3];
6865 -> 6994[label="",style="dashed", color="magenta", weight=3];
6866 -> 6995[label="",style="dashed", color="red", weight=0];
6866[label="(foldl' (+) $! (+) fromInt (Pos Zero) index1 EQ zx3610)",fontsize=16,color="magenta"];6866 -> 6996[label="",style="dashed", color="magenta", weight=3];
6867 -> 110[label="",style="dashed", color="red", weight=0];
6867[label="range (LT,GT)",fontsize=16,color="magenta"];6867 -> 7004[label="",style="dashed", color="magenta", weight=3];
6867 -> 7005[label="",style="dashed", color="magenta", weight=3];
6868 -> 110[label="",style="dashed", color="red", weight=0];
6868[label="range (EQ,GT)",fontsize=16,color="magenta"];6868 -> 7006[label="",style="dashed", color="magenta", weight=3];
6868 -> 7007[label="",style="dashed", color="magenta", weight=3];
6869 -> 7008[label="",style="dashed", color="red", weight=0];
6869[label="(foldl' (+) $! (+) fromInt (Pos Zero) index1 GT zx3620)",fontsize=16,color="magenta"];6869 -> 7009[label="",style="dashed", color="magenta", weight=3];
6870 -> 7054[label="",style="dashed", color="red", weight=0];
6870[label="(foldl' (+) $! (+) fromInt (Pos Zero) index0 False zx3640)",fontsize=16,color="magenta"];6870 -> 7055[label="",style="dashed", color="magenta", weight=3];
6871 -> 111[label="",style="dashed", color="red", weight=0];
6871[label="range (False,True)",fontsize=16,color="magenta"];6871 -> 7059[label="",style="dashed", color="magenta", weight=3];
6871 -> 7060[label="",style="dashed", color="magenta", weight=3];
6872 -> 7061[label="",style="dashed", color="red", weight=0];
6872[label="(foldl' (+) $! (+) fromInt (Pos Zero) index0 True zx3780)",fontsize=16,color="magenta"];6872 -> 7062[label="",style="dashed", color="magenta", weight=3];
6873[label="rangeSize1 EQ LT (null ((++) range4 LT EQ GT foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];6873 -> 7064[label="",style="solid", color="black", weight=3];
6874[label="rangeSize1 GT LT (null ((++) range4 LT GT GT foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];6874 -> 7065[label="",style="solid", color="black", weight=3];
6875[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare EQ EQ == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6875 -> 7066[label="",style="solid", color="black", weight=3];
7797[label="(++) range40 EQ (EQ >= GT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];7797 -> 7991[label="",style="solid", color="black", weight=3];
6877[label="rangeSize1 EQ GT (null ((++) range40 EQ (not False && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];6877 -> 7068[label="",style="solid", color="black", weight=3];
6878[label="rangeSize1 GT GT (null ((++) range40 EQ (not False && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];6878 -> 7069[label="",style="solid", color="black", weight=3];
6879[label="rangeSize1 True False (null [])",fontsize=16,color="black",shape="box"];6879 -> 7070[label="",style="solid", color="black", weight=3];
6880[label="rangeSize1 True True (null ((++) range00 True (not (compare True True == LT)) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];6880 -> 7071[label="",style="solid", color="black", weight=3];
6895[label="(++) range40 EQ (not (LT == LT) && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];6895 -> 7079[label="",style="solid", color="black", weight=3];
6896[label="(++) range40 EQ (not (LT == LT) && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6896 -> 7080[label="",style="solid", color="black", weight=3];
6897[label="(++) range40 EQ (not (LT == LT) && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];6897 -> 7081[label="",style="solid", color="black", weight=3];
6898[label="(++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT) && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];6898 -> 7082[label="",style="solid", color="black", weight=3];
6899[label="(++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];6899 -> 7083[label="",style="solid", color="black", weight=3];
6901[label="(++) range40 EQ (not (compare2 GT EQ (GT == EQ) == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];6901 -> 7085[label="",style="solid", color="black", weight=3];
6902[label="(++) range40 EQ (not (compare2 GT EQ (GT == EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];6902 -> 7086[label="",style="solid", color="black", weight=3];
6903[label="(++) range40 EQ (not (compare2 GT EQ (GT == EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];6903 -> 7087[label="",style="solid", color="black", weight=3];
6904[label="(++) range00 True (not (LT == LT) && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];6904 -> 7088[label="",style="solid", color="black", weight=3];
6905[label="(++) range00 True (not (LT == LT) && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];6905 -> 7089[label="",style="solid", color="black", weight=3];
6906[label="(++) range00 True (not (compare2 True True (True == True) == LT) && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];6906 -> 7090[label="",style="solid", color="black", weight=3];
6907[label="(++) range00 True (not (compare2 True True (True == True) == LT) && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];6907 -> 7091[label="",style="solid", color="black", weight=3];
10281[label="index5 (Integer (Pos (Succ zx692))) (Integer (Pos (Succ zx693))) (Integer (Pos (Succ zx693))) (not (primCmpNat (Succ zx6940) (Succ zx6940) == GT))",fontsize=16,color="black",shape="box"];10281 -> 10300[label="",style="solid", color="black", weight=3];
10282[label="index5 (Integer (Pos (Succ zx692))) (Integer (Pos (Succ zx693))) (Integer (Pos (Succ zx693))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];10282 -> 10301[label="",style="solid", color="black", weight=3];
8252[label="fromInteger (Integer (Pos (Succ zx556)) - Integer (Pos Zero))",fontsize=16,color="black",shape="box"];8252 -> 8261[label="",style="solid", color="black", weight=3];
7964 -> 6634[label="",style="dashed", color="red", weight=0];
7964[label="fromInteger (Integer (primMinusInt (Pos (Succ zx532)) (Neg (Succ zx531))))",fontsize=16,color="magenta"];7964 -> 8005[label="",style="dashed", color="magenta", weight=3];
10550[label="index5 (Integer (Neg (Succ zx708))) (Integer (Neg (Succ zx709))) (Integer (Neg (Succ zx709))) (not (primCmpNat (Succ zx7100) (Succ zx7100) == GT))",fontsize=16,color="black",shape="box"];10550 -> 10574[label="",style="solid", color="black", weight=3];
10551[label="index5 (Integer (Neg (Succ zx708))) (Integer (Neg (Succ zx709))) (Integer (Neg (Succ zx709))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];10551 -> 10575[label="",style="solid", color="black", weight=3];
6941[label="Neg (Succ zx64000)",fontsize=16,color="green",shape="box"];6942[label="Neg Zero",fontsize=16,color="green",shape="box"];8347 -> 6634[label="",style="dashed", color="red", weight=0];
8347[label="fromInteger (Integer (primMinusInt (Pos (Succ zx568)) (Neg Zero)))",fontsize=16,color="magenta"];8347 -> 8375[label="",style="dashed", color="magenta", weight=3];
10481[label="zx7020",fontsize=16,color="green",shape="box"];10482[label="index12 (Pos (Succ zx700)) (Pos (Succ zx701)) (Pos (Succ zx701)) (not False)",fontsize=16,color="black",shape="box"];10482 -> 10514[label="",style="solid", color="black", weight=3];
10512[label="zx7060",fontsize=16,color="green",shape="box"];10513[label="index12 (Neg (Succ zx704)) (Neg (Succ zx705)) (Neg (Succ zx705)) (not False)",fontsize=16,color="black",shape="box"];10513 -> 10552[label="",style="solid", color="black", weight=3];
6991 -> 7193[label="",style="dashed", color="red", weight=0];
6991[label="((+) fromInt (Pos Zero) index1 LT zx3600 `seq` foldl' (+) ((+) fromInt (Pos Zero) index1 LT zx3600))",fontsize=16,color="magenta"];6991 -> 7194[label="",style="dashed", color="magenta", weight=3];
6991 -> 7195[label="",style="dashed", color="magenta", weight=3];
6992[label="Pos Zero",fontsize=16,color="green",shape="box"];6993[label="LT",fontsize=16,color="green",shape="box"];6994[label="EQ",fontsize=16,color="green",shape="box"];6996 -> 6864[label="",style="dashed", color="red", weight=0];
6996[label="fromInt (Pos Zero)",fontsize=16,color="magenta"];6995[label="(foldl' (+) $! (+) zx455 index1 EQ zx3610)",fontsize=16,color="black",shape="triangle"];6995 -> 7196[label="",style="solid", color="black", weight=3];
7004[label="LT",fontsize=16,color="green",shape="box"];7005[label="GT",fontsize=16,color="green",shape="box"];7006[label="EQ",fontsize=16,color="green",shape="box"];7007[label="GT",fontsize=16,color="green",shape="box"];7009 -> 6864[label="",style="dashed", color="red", weight=0];
7009[label="fromInt (Pos Zero)",fontsize=16,color="magenta"];7008[label="(foldl' (+) $! (+) zx456 index1 GT zx3620)",fontsize=16,color="black",shape="triangle"];7008 -> 7197[label="",style="solid", color="black", weight=3];
7055 -> 6864[label="",style="dashed", color="red", weight=0];
7055[label="fromInt (Pos Zero)",fontsize=16,color="magenta"];7054[label="(foldl' (+) $! (+) zx459 index0 False zx3640)",fontsize=16,color="black",shape="triangle"];7054 -> 7198[label="",style="solid", color="black", weight=3];
7059[label="False",fontsize=16,color="green",shape="box"];7060[label="True",fontsize=16,color="green",shape="box"];7062 -> 6864[label="",style="dashed", color="red", weight=0];
7062[label="fromInt (Pos Zero)",fontsize=16,color="magenta"];7061[label="(foldl' (+) $! (+) zx460 index0 True zx3780)",fontsize=16,color="black",shape="triangle"];7061 -> 7199[label="",style="solid", color="black", weight=3];
7064[label="rangeSize1 EQ LT (null ((++) range40 GT (LT >= GT && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];7064 -> 7200[label="",style="solid", color="black", weight=3];
7065[label="rangeSize1 GT LT (null ((++) range40 GT (LT >= GT && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];7065 -> 7201[label="",style="solid", color="black", weight=3];
7066[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare3 EQ EQ == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7066 -> 7202[label="",style="solid", color="black", weight=3];
7991[label="(++) range40 EQ (compare EQ GT /= LT) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];7991 -> 8175[label="",style="solid", color="black", weight=3];
7068[label="rangeSize1 EQ GT (null ((++) range40 EQ (True && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7068 -> 7204[label="",style="solid", color="black", weight=3];
7069[label="rangeSize1 GT GT (null ((++) range40 EQ (True && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];7069 -> 7205[label="",style="solid", color="black", weight=3];
7070[label="rangeSize1 True False True",fontsize=16,color="black",shape="box"];7070 -> 7206[label="",style="solid", color="black", weight=3];
7071[label="rangeSize1 True True (null ((++) range00 True (not (compare3 True True == LT)) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];7071 -> 7207[label="",style="solid", color="black", weight=3];
7079[label="(++) range40 EQ (not True && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];7079 -> 7220[label="",style="solid", color="black", weight=3];
7080[label="(++) range40 EQ (not True && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7080 -> 7221[label="",style="solid", color="black", weight=3];
7081[label="(++) range40 EQ (not True && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];7081 -> 7222[label="",style="solid", color="black", weight=3];
7082[label="(++) range40 EQ (not (compare2 EQ EQ True == LT) && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];7082 -> 7223[label="",style="solid", color="black", weight=3];
7083[label="(++) range40 EQ (not (compare2 EQ EQ True == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];7083 -> 7224[label="",style="solid", color="black", weight=3];
7085[label="(++) range40 EQ (not (compare2 GT EQ False == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];7085 -> 7226[label="",style="solid", color="black", weight=3];
7086[label="(++) range40 EQ (not (compare2 GT EQ False == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7086 -> 7227[label="",style="solid", color="black", weight=3];
7087[label="(++) range40 EQ (not (compare2 GT EQ False == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];7087 -> 7228[label="",style="solid", color="black", weight=3];
7088[label="(++) range00 True (not True && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];7088 -> 7229[label="",style="solid", color="black", weight=3];
7089[label="(++) range00 True (not True && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];7089 -> 7230[label="",style="solid", color="black", weight=3];
7090[label="(++) range00 True (not (compare2 True True True == LT) && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];7090 -> 7231[label="",style="solid", color="black", weight=3];
7091[label="(++) range00 True (not (compare2 True True True == LT) && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];7091 -> 7232[label="",style="solid", color="black", weight=3];
10300 -> 10259[label="",style="dashed", color="red", weight=0];
10300[label="index5 (Integer (Pos (Succ zx692))) (Integer (Pos (Succ zx693))) (Integer (Pos (Succ zx693))) (not (primCmpNat zx6940 zx6940 == GT))",fontsize=16,color="magenta"];10300 -> 10307[label="",style="dashed", color="magenta", weight=3];
10301[label="index5 (Integer (Pos (Succ zx692))) (Integer (Pos (Succ zx693))) (Integer (Pos (Succ zx693))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];10301 -> 10308[label="",style="solid", color="black", weight=3];
8261 -> 6634[label="",style="dashed", color="red", weight=0];
8261[label="fromInteger (Integer (primMinusInt (Pos (Succ zx556)) (Pos Zero)))",fontsize=16,color="magenta"];8261 -> 8268[label="",style="dashed", color="magenta", weight=3];
8005 -> 3992[label="",style="dashed", color="red", weight=0];
8005[label="primMinusInt (Pos (Succ zx532)) (Neg (Succ zx531))",fontsize=16,color="magenta"];8005 -> 8015[label="",style="dashed", color="magenta", weight=3];
8005 -> 8016[label="",style="dashed", color="magenta", weight=3];
10574 -> 10519[label="",style="dashed", color="red", weight=0];
10574[label="index5 (Integer (Neg (Succ zx708))) (Integer (Neg (Succ zx709))) (Integer (Neg (Succ zx709))) (not (primCmpNat zx7100 zx7100 == GT))",fontsize=16,color="magenta"];10574 -> 10595[label="",style="dashed", color="magenta", weight=3];
10575[label="index5 (Integer (Neg (Succ zx708))) (Integer (Neg (Succ zx709))) (Integer (Neg (Succ zx709))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];10575 -> 10596[label="",style="solid", color="black", weight=3];
8375 -> 3992[label="",style="dashed", color="red", weight=0];
8375[label="primMinusInt (Pos (Succ zx568)) (Neg Zero)",fontsize=16,color="magenta"];8375 -> 8419[label="",style="dashed", color="magenta", weight=3];
8375 -> 8420[label="",style="dashed", color="magenta", weight=3];
10514[label="index12 (Pos (Succ zx700)) (Pos (Succ zx701)) (Pos (Succ zx701)) True",fontsize=16,color="black",shape="box"];10514 -> 10553[label="",style="solid", color="black", weight=3];
10552[label="index12 (Neg (Succ zx704)) (Neg (Succ zx705)) (Neg (Succ zx705)) True",fontsize=16,color="black",shape="box"];10552 -> 10576[label="",style="solid", color="black", weight=3];
7194 -> 6864[label="",style="dashed", color="red", weight=0];
7194[label="fromInt (Pos Zero)",fontsize=16,color="magenta"];7195 -> 6864[label="",style="dashed", color="red", weight=0];
7195[label="fromInt (Pos Zero)",fontsize=16,color="magenta"];7193[label="((+) zx473 index1 LT zx3600 `seq` foldl' (+) ((+) zx474 index1 LT zx3600))",fontsize=16,color="black",shape="triangle"];7193 -> 7337[label="",style="solid", color="black", weight=3];
7196[label="((+) zx455 index1 EQ zx3610 `seq` foldl' (+) ((+) zx455 index1 EQ zx3610))",fontsize=16,color="black",shape="box"];7196 -> 7338[label="",style="solid", color="black", weight=3];
7197[label="((+) zx456 index1 GT zx3620 `seq` foldl' (+) ((+) zx456 index1 GT zx3620))",fontsize=16,color="black",shape="box"];7197 -> 7339[label="",style="solid", color="black", weight=3];
7198[label="((+) zx459 index0 False zx3640 `seq` foldl' (+) ((+) zx459 index0 False zx3640))",fontsize=16,color="black",shape="box"];7198 -> 7340[label="",style="solid", color="black", weight=3];
7199[label="((+) zx460 index0 True zx3780 `seq` foldl' (+) ((+) zx460 index0 True zx3780))",fontsize=16,color="black",shape="box"];7199 -> 7341[label="",style="solid", color="black", weight=3];
7200[label="rangeSize1 EQ LT (null ((++) range40 GT (compare LT GT /= LT && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];7200 -> 7342[label="",style="solid", color="black", weight=3];
7201[label="rangeSize1 GT LT (null ((++) range40 GT (compare LT GT /= LT && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];7201 -> 7343[label="",style="solid", color="black", weight=3];
7202[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7202 -> 7344[label="",style="solid", color="black", weight=3];
8175[label="(++) range40 EQ (not (compare EQ GT == LT)) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];8175 -> 8327[label="",style="solid", color="black", weight=3];
7204[label="rangeSize1 EQ GT (null ((++) range40 EQ (EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7204 -> 7346[label="",style="solid", color="black", weight=3];
7205[label="rangeSize1 GT GT (null ((++) range40 EQ (EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];7205 -> 7347[label="",style="solid", color="black", weight=3];
7206[label="Pos Zero",fontsize=16,color="green",shape="box"];7207[label="rangeSize1 True True (null ((++) range00 True (not (compare2 True True (True == True) == LT)) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];7207 -> 7348[label="",style="solid", color="black", weight=3];
7220[label="(++) range40 EQ (False && EQ >= LT) foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];7220 -> 7393[label="",style="solid", color="black", weight=3];
7221[label="(++) range40 EQ (False && EQ >= EQ) foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7221 -> 7394[label="",style="solid", color="black", weight=3];
7222[label="(++) range40 EQ (False && EQ >= GT) foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];7222 -> 7395[label="",style="solid", color="black", weight=3];
7223[label="(++) range40 EQ (not (EQ == LT) && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];7223 -> 7396[label="",style="solid", color="black", weight=3];
7224[label="(++) range40 EQ (not (EQ == LT) && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];7224 -> 7397[label="",style="solid", color="black", weight=3];
7226[label="(++) range40 EQ (not (compare1 GT EQ (GT <= EQ) == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];7226 -> 7399[label="",style="solid", color="black", weight=3];
7227[label="(++) range40 EQ (not (compare1 GT EQ (GT <= EQ) == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7227 -> 7400[label="",style="solid", color="black", weight=3];
7228[label="(++) range40 EQ (not (compare1 GT EQ (GT <= EQ) == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];7228 -> 7401[label="",style="solid", color="black", weight=3];
7229[label="(++) range00 True (False && True >= False) foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];7229 -> 7402[label="",style="solid", color="black", weight=3];
7230[label="(++) range00 True (False && True >= True) foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];7230 -> 7403[label="",style="solid", color="black", weight=3];
7231[label="(++) range00 True (not (EQ == LT) && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];7231 -> 7404[label="",style="solid", color="black", weight=3];
7232[label="(++) range00 True (not (EQ == LT) && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];7232 -> 7405[label="",style="solid", color="black", weight=3];
10307[label="zx6940",fontsize=16,color="green",shape="box"];10308[label="index5 (Integer (Pos (Succ zx692))) (Integer (Pos (Succ zx693))) (Integer (Pos (Succ zx693))) (not False)",fontsize=16,color="black",shape="box"];10308 -> 10355[label="",style="solid", color="black", weight=3];
8268 -> 3992[label="",style="dashed", color="red", weight=0];
8268[label="primMinusInt (Pos (Succ zx556)) (Pos Zero)",fontsize=16,color="magenta"];8268 -> 8274[label="",style="dashed", color="magenta", weight=3];
8268 -> 8275[label="",style="dashed", color="magenta", weight=3];
8015[label="Neg (Succ zx531)",fontsize=16,color="green",shape="box"];8016[label="Pos (Succ zx532)",fontsize=16,color="green",shape="box"];10595[label="zx7100",fontsize=16,color="green",shape="box"];10596[label="index5 (Integer (Neg (Succ zx708))) (Integer (Neg (Succ zx709))) (Integer (Neg (Succ zx709))) (not False)",fontsize=16,color="black",shape="box"];10596 -> 10610[label="",style="solid", color="black", weight=3];
8419[label="Neg Zero",fontsize=16,color="green",shape="box"];8420[label="Pos (Succ zx568)",fontsize=16,color="green",shape="box"];10553 -> 3767[label="",style="dashed", color="red", weight=0];
10553[label="Pos (Succ zx701) - Pos (Succ zx700)",fontsize=16,color="magenta"];10553 -> 10577[label="",style="dashed", color="magenta", weight=3];
10553 -> 10578[label="",style="dashed", color="magenta", weight=3];
10576 -> 3767[label="",style="dashed", color="red", weight=0];
10576[label="Neg (Succ zx705) - Neg (Succ zx704)",fontsize=16,color="magenta"];10576 -> 10597[label="",style="dashed", color="magenta", weight=3];
10576 -> 10598[label="",style="dashed", color="magenta", weight=3];
7337[label="enforceWHNF (WHNF ((+) zx473 index1 LT zx3600)) (foldl' (+) ((+) zx474 index1 LT zx3600)) (map (index1 LT) zx3601)",fontsize=16,color="black",shape="box"];7337 -> 7567[label="",style="solid", color="black", weight=3];
7338[label="enforceWHNF (WHNF ((+) zx455 index1 EQ zx3610)) (foldl' (+) ((+) zx455 index1 EQ zx3610)) (map (index1 EQ) zx3611)",fontsize=16,color="black",shape="box"];7338 -> 7568[label="",style="solid", color="black", weight=3];
7339[label="enforceWHNF (WHNF ((+) zx456 index1 GT zx3620)) (foldl' (+) ((+) zx456 index1 GT zx3620)) (map (index1 GT) zx3621)",fontsize=16,color="black",shape="box"];7339 -> 7569[label="",style="solid", color="black", weight=3];
7340[label="enforceWHNF (WHNF ((+) zx459 index0 False zx3640)) (foldl' (+) ((+) zx459 index0 False zx3640)) (map (index0 False) zx3641)",fontsize=16,color="black",shape="box"];7340 -> 7570[label="",style="solid", color="black", weight=3];
7341[label="enforceWHNF (WHNF ((+) zx460 index0 True zx3780)) (foldl' (+) ((+) zx460 index0 True zx3780)) (map (index0 True) zx3781)",fontsize=16,color="black",shape="box"];7341 -> 7571[label="",style="solid", color="black", weight=3];
7342[label="rangeSize1 EQ LT (null ((++) range40 GT (not (compare LT GT == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];7342 -> 7572[label="",style="solid", color="black", weight=3];
7343[label="rangeSize1 GT LT (null ((++) range40 GT (not (compare LT GT == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];7343 -> 7573[label="",style="solid", color="black", weight=3];
7344[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (compare2 EQ EQ True == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7344 -> 7574[label="",style="solid", color="black", weight=3];
8327[label="(++) range40 EQ (not (compare3 EQ GT == LT)) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];8327 -> 8474[label="",style="solid", color="black", weight=3];
7346[label="rangeSize1 EQ GT (null ((++) range40 EQ (compare EQ EQ /= LT) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7346 -> 7576[label="",style="solid", color="black", weight=3];
7347[label="rangeSize1 GT GT (null ((++) range40 EQ (compare EQ GT /= LT) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];7347 -> 7577[label="",style="solid", color="black", weight=3];
7348[label="rangeSize1 True True (null ((++) range00 True (not (compare2 True True True == LT)) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];7348 -> 7578[label="",style="solid", color="black", weight=3];
7393[label="(++) range40 EQ False foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];7393 -> 7579[label="",style="solid", color="black", weight=3];
7394[label="(++) range40 EQ False foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7394 -> 7580[label="",style="solid", color="black", weight=3];
7395[label="(++) range40 EQ False foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];7395 -> 7581[label="",style="solid", color="black", weight=3];
7396[label="(++) range40 EQ (not False && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];7396 -> 7582[label="",style="solid", color="black", weight=3];
7397[label="(++) range40 EQ (not False && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];7397 -> 7583[label="",style="solid", color="black", weight=3];
7399[label="(++) range40 EQ (not (compare1 GT EQ False == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];7399 -> 7585[label="",style="solid", color="black", weight=3];
7400[label="(++) range40 EQ (not (compare1 GT EQ False == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7400 -> 7586[label="",style="solid", color="black", weight=3];
7401[label="(++) range40 EQ (not (compare1 GT EQ False == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];7401 -> 7587[label="",style="solid", color="black", weight=3];
7402[label="(++) range00 True False foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];7402 -> 7588[label="",style="solid", color="black", weight=3];
7403[label="(++) range00 True False foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];7403 -> 7589[label="",style="solid", color="black", weight=3];
7404[label="(++) range00 True (not False && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];7404 -> 7590[label="",style="solid", color="black", weight=3];
7405[label="(++) range00 True (not False && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];7405 -> 7591[label="",style="solid", color="black", weight=3];
10355[label="index5 (Integer (Pos (Succ zx692))) (Integer (Pos (Succ zx693))) (Integer (Pos (Succ zx693))) True",fontsize=16,color="black",shape="box"];10355 -> 10399[label="",style="solid", color="black", weight=3];
8274[label="Pos Zero",fontsize=16,color="green",shape="box"];8275[label="Pos (Succ zx556)",fontsize=16,color="green",shape="box"];10610[label="index5 (Integer (Neg (Succ zx708))) (Integer (Neg (Succ zx709))) (Integer (Neg (Succ zx709))) True",fontsize=16,color="black",shape="box"];10610 -> 10621[label="",style="solid", color="black", weight=3];
10577[label="Pos (Succ zx700)",fontsize=16,color="green",shape="box"];10578[label="Pos (Succ zx701)",fontsize=16,color="green",shape="box"];10597[label="Neg (Succ zx704)",fontsize=16,color="green",shape="box"];10598[label="Neg (Succ zx705)",fontsize=16,color="green",shape="box"];7567 -> 9382[label="",style="dashed", color="red", weight=0];
7567[label="enforceWHNF (WHNF (primPlusInt zx473 (index1 LT zx3600))) (foldl' primPlusInt (primPlusInt zx474 (index1 LT zx3600))) (map (index1 LT) zx3601)",fontsize=16,color="magenta"];7567 -> 9383[label="",style="dashed", color="magenta", weight=3];
7567 -> 9384[label="",style="dashed", color="magenta", weight=3];
7568 -> 9489[label="",style="dashed", color="red", weight=0];
7568[label="enforceWHNF (WHNF (primPlusInt zx455 (index1 EQ zx3610))) (foldl' primPlusInt (primPlusInt zx455 (index1 EQ zx3610))) (map (index1 EQ) zx3611)",fontsize=16,color="magenta"];7568 -> 9490[label="",style="dashed", color="magenta", weight=3];
7568 -> 9491[label="",style="dashed", color="magenta", weight=3];
7569 -> 9617[label="",style="dashed", color="red", weight=0];
7569[label="enforceWHNF (WHNF (primPlusInt zx456 (index1 GT zx3620))) (foldl' primPlusInt (primPlusInt zx456 (index1 GT zx3620))) (map (index1 GT) zx3621)",fontsize=16,color="magenta"];7569 -> 9618[label="",style="dashed", color="magenta", weight=3];
7569 -> 9619[label="",style="dashed", color="magenta", weight=3];
7570 -> 9813[label="",style="dashed", color="red", weight=0];
7570[label="enforceWHNF (WHNF (primPlusInt zx459 (index0 False zx3640))) (foldl' primPlusInt (primPlusInt zx459 (index0 False zx3640))) (map (index0 False) zx3641)",fontsize=16,color="magenta"];7570 -> 9814[label="",style="dashed", color="magenta", weight=3];
7570 -> 9815[label="",style="dashed", color="magenta", weight=3];
7571 -> 10062[label="",style="dashed", color="red", weight=0];
7571[label="enforceWHNF (WHNF (primPlusInt zx460 (index0 True zx3780))) (foldl' primPlusInt (primPlusInt zx460 (index0 True zx3780))) (map (index0 True) zx3781)",fontsize=16,color="magenta"];7571 -> 10063[label="",style="dashed", color="magenta", weight=3];
7571 -> 10064[label="",style="dashed", color="magenta", weight=3];
7572[label="rangeSize1 EQ LT (null ((++) range40 GT (not (compare3 LT GT == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];7572 -> 7785[label="",style="solid", color="black", weight=3];
7573[label="rangeSize1 GT LT (null ((++) range40 GT (not (compare3 LT GT == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];7573 -> 7786[label="",style="solid", color="black", weight=3];
7574[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not (EQ == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7574 -> 7787[label="",style="solid", color="black", weight=3];
8474[label="(++) range40 EQ (not (compare2 EQ GT (EQ == GT) == LT)) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];8474 -> 8667[label="",style="solid", color="black", weight=3];
7576[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare EQ EQ == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7576 -> 7789[label="",style="solid", color="black", weight=3];
7577[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare EQ GT == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];7577 -> 7790[label="",style="solid", color="black", weight=3];
7578[label="rangeSize1 True True (null ((++) range00 True (not (EQ == LT)) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];7578 -> 7791[label="",style="solid", color="black", weight=3];
7579[label="(++) [] foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];7579 -> 7792[label="",style="solid", color="black", weight=3];
7580[label="(++) [] foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7580 -> 7793[label="",style="solid", color="black", weight=3];
7581[label="(++) [] foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];7581 -> 7794[label="",style="solid", color="black", weight=3];
7582[label="(++) range40 EQ (True && EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];7582 -> 7795[label="",style="solid", color="black", weight=3];
7583[label="(++) range40 EQ (True && EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];7583 -> 7796[label="",style="solid", color="black", weight=3];
7585[label="(++) range40 EQ (not (compare0 GT EQ otherwise == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];7585 -> 7798[label="",style="solid", color="black", weight=3];
7586[label="(++) range40 EQ (not (compare0 GT EQ otherwise == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7586 -> 7799[label="",style="solid", color="black", weight=3];
7587[label="(++) range40 EQ (not (compare0 GT EQ otherwise == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];7587 -> 7800[label="",style="solid", color="black", weight=3];
7588[label="(++) [] foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];7588 -> 7801[label="",style="solid", color="black", weight=3];
7589[label="(++) [] foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];7589 -> 7802[label="",style="solid", color="black", weight=3];
7590[label="(++) range00 True (True && True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];7590 -> 7803[label="",style="solid", color="black", weight=3];
7591[label="(++) range00 True (True && True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];7591 -> 7804[label="",style="solid", color="black", weight=3];
10399[label="fromInteger (Integer (Pos (Succ zx693)) - Integer (Pos (Succ zx692)))",fontsize=16,color="black",shape="box"];10399 -> 10445[label="",style="solid", color="black", weight=3];
10621[label="fromInteger (Integer (Neg (Succ zx709)) - Integer (Neg (Succ zx708)))",fontsize=16,color="black",shape="box"];10621 -> 10630[label="",style="solid", color="black", weight=3];
9383[label="primPlusInt zx474 (index1 LT zx3600)",fontsize=16,color="burlywood",shape="triangle"];12002[label="zx474/Pos zx4740",fontsize=10,color="white",style="solid",shape="box"];9383 -> 12002[label="",style="solid", color="burlywood", weight=9];
12002 -> 9467[label="",style="solid", color="burlywood", weight=3];
12003[label="zx474/Neg zx4740",fontsize=10,color="white",style="solid",shape="box"];9383 -> 12003[label="",style="solid", color="burlywood", weight=9];
12003 -> 9468[label="",style="solid", color="burlywood", weight=3];
9384 -> 9383[label="",style="dashed", color="red", weight=0];
9384[label="primPlusInt zx473 (index1 LT zx3600)",fontsize=16,color="magenta"];9384 -> 9469[label="",style="dashed", color="magenta", weight=3];
9382[label="enforceWHNF (WHNF zx664) (foldl' primPlusInt zx663) (map (index1 LT) zx3601)",fontsize=16,color="black",shape="triangle"];9382 -> 9470[label="",style="solid", color="black", weight=3];
9490[label="primPlusInt zx455 (index1 EQ zx3610)",fontsize=16,color="burlywood",shape="triangle"];12005[label="zx455/Pos zx4550",fontsize=10,color="white",style="solid",shape="box"];9490 -> 12005[label="",style="solid", color="burlywood", weight=9];
12005 -> 9584[label="",style="solid", color="burlywood", weight=3];
12006[label="zx455/Neg zx4550",fontsize=10,color="white",style="solid",shape="box"];9490 -> 12006[label="",style="solid", color="burlywood", weight=9];
12006 -> 9585[label="",style="solid", color="burlywood", weight=3];
9491 -> 9490[label="",style="dashed", color="red", weight=0];
9491[label="primPlusInt zx455 (index1 EQ zx3610)",fontsize=16,color="magenta"];9489[label="enforceWHNF (WHNF zx668) (foldl' primPlusInt zx667) (map (index1 EQ) zx3611)",fontsize=16,color="black",shape="triangle"];9489 -> 9586[label="",style="solid", color="black", weight=3];
9618[label="primPlusInt zx456 (index1 GT zx3620)",fontsize=16,color="burlywood",shape="triangle"];12008[label="zx456/Pos zx4560",fontsize=10,color="white",style="solid",shape="box"];9618 -> 12008[label="",style="solid", color="burlywood", weight=9];
12008 -> 9718[label="",style="solid", color="burlywood", weight=3];
12009[label="zx456/Neg zx4560",fontsize=10,color="white",style="solid",shape="box"];9618 -> 12009[label="",style="solid", color="burlywood", weight=9];
12009 -> 9719[label="",style="solid", color="burlywood", weight=3];
9619 -> 9618[label="",style="dashed", color="red", weight=0];
9619[label="primPlusInt zx456 (index1 GT zx3620)",fontsize=16,color="magenta"];9617[label="enforceWHNF (WHNF zx672) (foldl' primPlusInt zx671) (map (index1 GT) zx3621)",fontsize=16,color="black",shape="triangle"];9617 -> 9720[label="",style="solid", color="black", weight=3];
9814[label="primPlusInt zx459 (index0 False zx3640)",fontsize=16,color="burlywood",shape="triangle"];12011[label="zx459/Pos zx4590",fontsize=10,color="white",style="solid",shape="box"];9814 -> 12011[label="",style="solid", color="burlywood", weight=9];
12011 -> 9879[label="",style="solid", color="burlywood", weight=3];
12012[label="zx459/Neg zx4590",fontsize=10,color="white",style="solid",shape="box"];9814 -> 12012[label="",style="solid", color="burlywood", weight=9];
12012 -> 9880[label="",style="solid", color="burlywood", weight=3];
9815 -> 9814[label="",style="dashed", color="red", weight=0];
9815[label="primPlusInt zx459 (index0 False zx3640)",fontsize=16,color="magenta"];9813[label="enforceWHNF (WHNF zx678) (foldl' primPlusInt zx677) (map (index0 False) zx3641)",fontsize=16,color="black",shape="triangle"];9813 -> 9881[label="",style="solid", color="black", weight=3];
10063[label="primPlusInt zx460 (index0 True zx3780)",fontsize=16,color="burlywood",shape="triangle"];12014[label="zx460/Pos zx4600",fontsize=10,color="white",style="solid",shape="box"];10063 -> 12014[label="",style="solid", color="burlywood", weight=9];
12014 -> 10129[label="",style="solid", color="burlywood", weight=3];
12015[label="zx460/Neg zx4600",fontsize=10,color="white",style="solid",shape="box"];10063 -> 12015[label="",style="solid", color="burlywood", weight=9];
12015 -> 10130[label="",style="solid", color="burlywood", weight=3];
10064 -> 10063[label="",style="dashed", color="red", weight=0];
10064[label="primPlusInt zx460 (index0 True zx3780)",fontsize=16,color="magenta"];10062[label="enforceWHNF (WHNF zx690) (foldl' primPlusInt zx689) (map (index0 True) zx3781)",fontsize=16,color="black",shape="triangle"];10062 -> 10131[label="",style="solid", color="black", weight=3];
7785[label="rangeSize1 EQ LT (null ((++) range40 GT (not (compare2 LT GT (LT == GT) == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];7785 -> 7979[label="",style="solid", color="black", weight=3];
7786[label="rangeSize1 GT LT (null ((++) range40 GT (not (compare2 LT GT (LT == GT) == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];7786 -> 7980[label="",style="solid", color="black", weight=3];
7787[label="rangeSize1 EQ EQ (null ((++) range40 EQ (not False) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7787 -> 7981[label="",style="solid", color="black", weight=3];
8667[label="(++) range40 EQ (not (compare2 EQ GT False == LT)) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];8667 -> 8859[label="",style="solid", color="black", weight=3];
7789[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare3 EQ EQ == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7789 -> 7983[label="",style="solid", color="black", weight=3];
7790[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare3 EQ GT == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];7790 -> 7984[label="",style="solid", color="black", weight=3];
7791[label="rangeSize1 True True (null ((++) range00 True (not False) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];7791 -> 7985[label="",style="solid", color="black", weight=3];
7792[label="foldr (++) [] (map (range4 LT LT) (GT : []))",fontsize=16,color="black",shape="box"];7792 -> 7986[label="",style="solid", color="black", weight=3];
7793[label="foldr (++) [] (map (range4 LT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7793 -> 7987[label="",style="solid", color="black", weight=3];
7794[label="foldr (++) [] (map (range4 LT GT) (GT : []))",fontsize=16,color="black",shape="box"];7794 -> 7988[label="",style="solid", color="black", weight=3];
7795[label="(++) range40 EQ (EQ >= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];7795 -> 7989[label="",style="solid", color="black", weight=3];
7796[label="(++) range40 EQ (EQ >= EQ) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];7796 -> 7990[label="",style="solid", color="black", weight=3];
7798[label="(++) range40 EQ (not (compare0 GT EQ True == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];7798 -> 7992[label="",style="solid", color="black", weight=3];
7799[label="(++) range40 EQ (not (compare0 GT EQ True == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7799 -> 7993[label="",style="solid", color="black", weight=3];
7800[label="(++) range40 EQ (not (compare0 GT EQ True == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];7800 -> 7994[label="",style="solid", color="black", weight=3];
7801[label="foldr (++) [] (map (range0 False False) [])",fontsize=16,color="black",shape="box"];7801 -> 7995[label="",style="solid", color="black", weight=3];
7802[label="foldr (++) [] (map (range0 False True) [])",fontsize=16,color="black",shape="box"];7802 -> 7996[label="",style="solid", color="black", weight=3];
7803[label="(++) range00 True (True >= False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];7803 -> 7997[label="",style="solid", color="black", weight=3];
7804[label="(++) range00 True (True >= True) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];7804 -> 7998[label="",style="solid", color="black", weight=3];
10445 -> 6634[label="",style="dashed", color="red", weight=0];
10445[label="fromInteger (Integer (primMinusInt (Pos (Succ zx693)) (Pos (Succ zx692))))",fontsize=16,color="magenta"];10445 -> 10483[label="",style="dashed", color="magenta", weight=3];
10630 -> 6634[label="",style="dashed", color="red", weight=0];
10630[label="fromInteger (Integer (primMinusInt (Neg (Succ zx709)) (Neg (Succ zx708))))",fontsize=16,color="magenta"];10630 -> 10639[label="",style="dashed", color="magenta", weight=3];
9467[label="primPlusInt (Pos zx4740) (index1 LT zx3600)",fontsize=16,color="black",shape="box"];9467 -> 9484[label="",style="solid", color="black", weight=3];
9468[label="primPlusInt (Neg zx4740) (index1 LT zx3600)",fontsize=16,color="black",shape="box"];9468 -> 9485[label="",style="solid", color="black", weight=3];
9469[label="zx473",fontsize=16,color="green",shape="box"];9470[label="foldl' primPlusInt zx663 (map (index1 LT) zx3601)",fontsize=16,color="burlywood",shape="box"];12019[label="zx3601/zx36010 : zx36011",fontsize=10,color="white",style="solid",shape="box"];9470 -> 12019[label="",style="solid", color="burlywood", weight=9];
12019 -> 9486[label="",style="solid", color="burlywood", weight=3];
12020[label="zx3601/[]",fontsize=10,color="white",style="solid",shape="box"];9470 -> 12020[label="",style="solid", color="burlywood", weight=9];
12020 -> 9487[label="",style="solid", color="burlywood", weight=3];
9584[label="primPlusInt (Pos zx4550) (index1 EQ zx3610)",fontsize=16,color="black",shape="box"];9584 -> 9607[label="",style="solid", color="black", weight=3];
9585[label="primPlusInt (Neg zx4550) (index1 EQ zx3610)",fontsize=16,color="black",shape="box"];9585 -> 9608[label="",style="solid", color="black", weight=3];
9586[label="foldl' primPlusInt zx667 (map (index1 EQ) zx3611)",fontsize=16,color="burlywood",shape="box"];12021[label="zx3611/zx36110 : zx36111",fontsize=10,color="white",style="solid",shape="box"];9586 -> 12021[label="",style="solid", color="burlywood", weight=9];
12021 -> 9609[label="",style="solid", color="burlywood", weight=3];
12022[label="zx3611/[]",fontsize=10,color="white",style="solid",shape="box"];9586 -> 12022[label="",style="solid", color="burlywood", weight=9];
12022 -> 9610[label="",style="solid", color="burlywood", weight=3];
9718[label="primPlusInt (Pos zx4560) (index1 GT zx3620)",fontsize=16,color="black",shape="box"];9718 -> 9740[label="",style="solid", color="black", weight=3];
9719[label="primPlusInt (Neg zx4560) (index1 GT zx3620)",fontsize=16,color="black",shape="box"];9719 -> 9741[label="",style="solid", color="black", weight=3];
9720[label="foldl' primPlusInt zx671 (map (index1 GT) zx3621)",fontsize=16,color="burlywood",shape="box"];12023[label="zx3621/zx36210 : zx36211",fontsize=10,color="white",style="solid",shape="box"];9720 -> 12023[label="",style="solid", color="burlywood", weight=9];
12023 -> 9742[label="",style="solid", color="burlywood", weight=3];
12024[label="zx3621/[]",fontsize=10,color="white",style="solid",shape="box"];9720 -> 12024[label="",style="solid", color="burlywood", weight=9];
12024 -> 9743[label="",style="solid", color="burlywood", weight=3];
9879[label="primPlusInt (Pos zx4590) (index0 False zx3640)",fontsize=16,color="black",shape="box"];9879 -> 9901[label="",style="solid", color="black", weight=3];
9880[label="primPlusInt (Neg zx4590) (index0 False zx3640)",fontsize=16,color="black",shape="box"];9880 -> 9902[label="",style="solid", color="black", weight=3];
9881[label="foldl' primPlusInt zx677 (map (index0 False) zx3641)",fontsize=16,color="burlywood",shape="box"];12025[label="zx3641/zx36410 : zx36411",fontsize=10,color="white",style="solid",shape="box"];9881 -> 12025[label="",style="solid", color="burlywood", weight=9];
12025 -> 9903[label="",style="solid", color="burlywood", weight=3];
12026[label="zx3641/[]",fontsize=10,color="white",style="solid",shape="box"];9881 -> 12026[label="",style="solid", color="burlywood", weight=9];
12026 -> 9904[label="",style="solid", color="burlywood", weight=3];
10129[label="primPlusInt (Pos zx4600) (index0 True zx3780)",fontsize=16,color="black",shape="box"];10129 -> 10189[label="",style="solid", color="black", weight=3];
10130[label="primPlusInt (Neg zx4600) (index0 True zx3780)",fontsize=16,color="black",shape="box"];10130 -> 10190[label="",style="solid", color="black", weight=3];
10131[label="foldl' primPlusInt zx689 (map (index0 True) zx3781)",fontsize=16,color="burlywood",shape="box"];12027[label="zx3781/zx37810 : zx37811",fontsize=10,color="white",style="solid",shape="box"];10131 -> 12027[label="",style="solid", color="burlywood", weight=9];
12027 -> 10191[label="",style="solid", color="burlywood", weight=3];
12028[label="zx3781/[]",fontsize=10,color="white",style="solid",shape="box"];10131 -> 12028[label="",style="solid", color="burlywood", weight=9];
12028 -> 10192[label="",style="solid", color="burlywood", weight=3];
7979[label="rangeSize1 EQ LT (null ((++) range40 GT (not (compare2 LT GT False == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];7979 -> 8163[label="",style="solid", color="black", weight=3];
7980[label="rangeSize1 GT LT (null ((++) range40 GT (not (compare2 LT GT False == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];7980 -> 8164[label="",style="solid", color="black", weight=3];
7981[label="rangeSize1 EQ EQ (null ((++) range40 EQ True foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7981 -> 8165[label="",style="solid", color="black", weight=3];
8859[label="(++) range40 EQ (not (compare1 EQ GT (EQ <= GT) == LT)) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];8859 -> 9006[label="",style="solid", color="black", weight=3];
7983[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];7983 -> 8167[label="",style="solid", color="black", weight=3];
7984[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare2 EQ GT (EQ == GT) == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];7984 -> 8168[label="",style="solid", color="black", weight=3];
7985[label="rangeSize1 True True (null ((++) range00 True True foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];7985 -> 8169[label="",style="solid", color="black", weight=3];
7986[label="foldr (++) [] (range4 LT LT GT : map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];7986 -> 8170[label="",style="solid", color="black", weight=3];
7987[label="foldr (++) [] (range4 LT EQ GT : map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];7987 -> 8171[label="",style="solid", color="black", weight=3];
7988[label="foldr (++) [] (range4 LT GT GT : map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];7988 -> 8172[label="",style="solid", color="black", weight=3];
7989[label="(++) range40 EQ (compare EQ LT /= LT) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];7989 -> 8173[label="",style="solid", color="black", weight=3];
7990[label="(++) range40 EQ (compare EQ EQ /= LT) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];7990 -> 8174[label="",style="solid", color="black", weight=3];
7992[label="(++) range40 EQ (not (GT == LT) && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];7992 -> 8176[label="",style="solid", color="black", weight=3];
7993[label="(++) range40 EQ (not (GT == LT) && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];7993 -> 8177[label="",style="solid", color="black", weight=3];
7994[label="(++) range40 EQ (not (GT == LT) && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];7994 -> 8178[label="",style="solid", color="black", weight=3];
7995[label="foldr (++) [] []",fontsize=16,color="black",shape="triangle"];7995 -> 8179[label="",style="solid", color="black", weight=3];
7996 -> 7995[label="",style="dashed", color="red", weight=0];
7996[label="foldr (++) [] []",fontsize=16,color="magenta"];7997[label="(++) range00 True (compare True False /= LT) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];7997 -> 8180[label="",style="solid", color="black", weight=3];
7998[label="(++) range00 True (compare True True /= LT) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];7998 -> 8181[label="",style="solid", color="black", weight=3];
10483 -> 3992[label="",style="dashed", color="red", weight=0];
10483[label="primMinusInt (Pos (Succ zx693)) (Pos (Succ zx692))",fontsize=16,color="magenta"];10483 -> 10515[label="",style="dashed", color="magenta", weight=3];
10483 -> 10516[label="",style="dashed", color="magenta", weight=3];
10639 -> 3992[label="",style="dashed", color="red", weight=0];
10639[label="primMinusInt (Neg (Succ zx709)) (Neg (Succ zx708))",fontsize=16,color="magenta"];10639 -> 10648[label="",style="dashed", color="magenta", weight=3];
10639 -> 10649[label="",style="dashed", color="magenta", weight=3];
9484[label="primPlusInt (Pos zx4740) (index10 (LT > zx3600))",fontsize=16,color="black",shape="box"];9484 -> 9587[label="",style="solid", color="black", weight=3];
9485[label="primPlusInt (Neg zx4740) (index10 (LT > zx3600))",fontsize=16,color="black",shape="box"];9485 -> 9588[label="",style="solid", color="black", weight=3];
9486[label="foldl' primPlusInt zx663 (map (index1 LT) (zx36010 : zx36011))",fontsize=16,color="black",shape="box"];9486 -> 9589[label="",style="solid", color="black", weight=3];
9487[label="foldl' primPlusInt zx663 (map (index1 LT) [])",fontsize=16,color="black",shape="box"];9487 -> 9590[label="",style="solid", color="black", weight=3];
9607[label="primPlusInt (Pos zx4550) (index10 (EQ > zx3610))",fontsize=16,color="black",shape="box"];9607 -> 9721[label="",style="solid", color="black", weight=3];
9608[label="primPlusInt (Neg zx4550) (index10 (EQ > zx3610))",fontsize=16,color="black",shape="box"];9608 -> 9722[label="",style="solid", color="black", weight=3];
9609[label="foldl' primPlusInt zx667 (map (index1 EQ) (zx36110 : zx36111))",fontsize=16,color="black",shape="box"];9609 -> 9723[label="",style="solid", color="black", weight=3];
9610[label="foldl' primPlusInt zx667 (map (index1 EQ) [])",fontsize=16,color="black",shape="box"];9610 -> 9724[label="",style="solid", color="black", weight=3];
9740[label="primPlusInt (Pos zx4560) (index10 (GT > zx3620))",fontsize=16,color="black",shape="box"];9740 -> 9772[label="",style="solid", color="black", weight=3];
9741[label="primPlusInt (Neg zx4560) (index10 (GT > zx3620))",fontsize=16,color="black",shape="box"];9741 -> 9773[label="",style="solid", color="black", weight=3];
9742[label="foldl' primPlusInt zx671 (map (index1 GT) (zx36210 : zx36211))",fontsize=16,color="black",shape="box"];9742 -> 9774[label="",style="solid", color="black", weight=3];
9743[label="foldl' primPlusInt zx671 (map (index1 GT) [])",fontsize=16,color="black",shape="box"];9743 -> 9775[label="",style="solid", color="black", weight=3];
9901[label="primPlusInt (Pos zx4590) (index00 (False > zx3640))",fontsize=16,color="black",shape="box"];9901 -> 9931[label="",style="solid", color="black", weight=3];
9902[label="primPlusInt (Neg zx4590) (index00 (False > zx3640))",fontsize=16,color="black",shape="box"];9902 -> 9932[label="",style="solid", color="black", weight=3];
9903[label="foldl' primPlusInt zx677 (map (index0 False) (zx36410 : zx36411))",fontsize=16,color="black",shape="box"];9903 -> 9933[label="",style="solid", color="black", weight=3];
9904[label="foldl' primPlusInt zx677 (map (index0 False) [])",fontsize=16,color="black",shape="box"];9904 -> 9934[label="",style="solid", color="black", weight=3];
10189[label="primPlusInt (Pos zx4600) (index00 (True > zx3780))",fontsize=16,color="black",shape="box"];10189 -> 10249[label="",style="solid", color="black", weight=3];
10190[label="primPlusInt (Neg zx4600) (index00 (True > zx3780))",fontsize=16,color="black",shape="box"];10190 -> 10250[label="",style="solid", color="black", weight=3];
10191[label="foldl' primPlusInt zx689 (map (index0 True) (zx37810 : zx37811))",fontsize=16,color="black",shape="box"];10191 -> 10251[label="",style="solid", color="black", weight=3];
10192[label="foldl' primPlusInt zx689 (map (index0 True) [])",fontsize=16,color="black",shape="box"];10192 -> 10252[label="",style="solid", color="black", weight=3];
8163[label="rangeSize1 EQ LT (null ((++) range40 GT (not (compare1 LT GT (LT <= GT) == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];8163 -> 8315[label="",style="solid", color="black", weight=3];
8164[label="rangeSize1 GT LT (null ((++) range40 GT (not (compare1 LT GT (LT <= GT) == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];8164 -> 8316[label="",style="solid", color="black", weight=3];
8165[label="rangeSize1 EQ EQ (null ((++) (EQ : []) foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8165 -> 8317[label="",style="solid", color="black", weight=3];
9006[label="(++) range40 EQ (not (compare1 EQ GT True == LT)) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];9006 -> 9155[label="",style="solid", color="black", weight=3];
8167[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (compare2 EQ EQ True == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8167 -> 8319[label="",style="solid", color="black", weight=3];
8168[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare2 EQ GT False == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];8168 -> 8320[label="",style="solid", color="black", weight=3];
8169[label="rangeSize1 True True (null ((++) (True : []) foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];8169 -> 8321[label="",style="solid", color="black", weight=3];
8170[label="(++) range4 LT LT GT foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];8170 -> 8322[label="",style="solid", color="black", weight=3];
8171[label="(++) range4 LT EQ GT foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];8171 -> 8323[label="",style="solid", color="black", weight=3];
8172[label="(++) range4 LT GT GT foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];8172 -> 8324[label="",style="solid", color="black", weight=3];
8173[label="(++) range40 EQ (not (compare EQ LT == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];8173 -> 8325[label="",style="solid", color="black", weight=3];
8174[label="(++) range40 EQ (not (compare EQ EQ == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];8174 -> 8326[label="",style="solid", color="black", weight=3];
8176[label="(++) range40 EQ (not False && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];8176 -> 8328[label="",style="solid", color="black", weight=3];
8177[label="(++) range40 EQ (not False && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];8177 -> 8329[label="",style="solid", color="black", weight=3];
8178[label="(++) range40 EQ (not False && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];8178 -> 8330[label="",style="solid", color="black", weight=3];
8179[label="[]",fontsize=16,color="green",shape="box"];8180[label="(++) range00 True (not (compare True False == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];8180 -> 8331[label="",style="solid", color="black", weight=3];
8181[label="(++) range00 True (not (compare True True == LT)) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];8181 -> 8332[label="",style="solid", color="black", weight=3];
10515[label="Pos (Succ zx692)",fontsize=16,color="green",shape="box"];10516[label="Pos (Succ zx693)",fontsize=16,color="green",shape="box"];10648[label="Neg (Succ zx708)",fontsize=16,color="green",shape="box"];10649[label="Neg (Succ zx709)",fontsize=16,color="green",shape="box"];9587[label="primPlusInt (Pos zx4740) (index10 (compare LT zx3600 == GT))",fontsize=16,color="black",shape="box"];9587 -> 9611[label="",style="solid", color="black", weight=3];
9588[label="primPlusInt (Neg zx4740) (index10 (compare LT zx3600 == GT))",fontsize=16,color="black",shape="box"];9588 -> 9612[label="",style="solid", color="black", weight=3];
9589[label="foldl' primPlusInt zx663 (index1 LT zx36010 : map (index1 LT) zx36011)",fontsize=16,color="black",shape="box"];9589 -> 9613[label="",style="solid", color="black", weight=3];
9590[label="foldl' primPlusInt zx663 []",fontsize=16,color="black",shape="triangle"];9590 -> 9614[label="",style="solid", color="black", weight=3];
9721[label="primPlusInt (Pos zx4550) (index10 (compare EQ zx3610 == GT))",fontsize=16,color="black",shape="box"];9721 -> 9744[label="",style="solid", color="black", weight=3];
9722[label="primPlusInt (Neg zx4550) (index10 (compare EQ zx3610 == GT))",fontsize=16,color="black",shape="box"];9722 -> 9745[label="",style="solid", color="black", weight=3];
9723[label="foldl' primPlusInt zx667 (index1 EQ zx36110 : map (index1 EQ) zx36111)",fontsize=16,color="black",shape="box"];9723 -> 9746[label="",style="solid", color="black", weight=3];
9724 -> 9590[label="",style="dashed", color="red", weight=0];
9724[label="foldl' primPlusInt zx667 []",fontsize=16,color="magenta"];9724 -> 9747[label="",style="dashed", color="magenta", weight=3];
9772[label="primPlusInt (Pos zx4560) (index10 (compare GT zx3620 == GT))",fontsize=16,color="black",shape="box"];9772 -> 9793[label="",style="solid", color="black", weight=3];
9773[label="primPlusInt (Neg zx4560) (index10 (compare GT zx3620 == GT))",fontsize=16,color="black",shape="box"];9773 -> 9794[label="",style="solid", color="black", weight=3];
9774[label="foldl' primPlusInt zx671 (index1 GT zx36210 : map (index1 GT) zx36211)",fontsize=16,color="black",shape="box"];9774 -> 9795[label="",style="solid", color="black", weight=3];
9775 -> 9590[label="",style="dashed", color="red", weight=0];
9775[label="foldl' primPlusInt zx671 []",fontsize=16,color="magenta"];9775 -> 9796[label="",style="dashed", color="magenta", weight=3];
9931[label="primPlusInt (Pos zx4590) (index00 (compare False zx3640 == GT))",fontsize=16,color="black",shape="box"];9931 -> 9958[label="",style="solid", color="black", weight=3];
9932[label="primPlusInt (Neg zx4590) (index00 (compare False zx3640 == GT))",fontsize=16,color="black",shape="box"];9932 -> 9959[label="",style="solid", color="black", weight=3];
9933[label="foldl' primPlusInt zx677 (index0 False zx36410 : map (index0 False) zx36411)",fontsize=16,color="black",shape="box"];9933 -> 9960[label="",style="solid", color="black", weight=3];
9934 -> 9590[label="",style="dashed", color="red", weight=0];
9934[label="foldl' primPlusInt zx677 []",fontsize=16,color="magenta"];9934 -> 9961[label="",style="dashed", color="magenta", weight=3];
10249[label="primPlusInt (Pos zx4600) (index00 (compare True zx3780 == GT))",fontsize=16,color="black",shape="box"];10249 -> 10283[label="",style="solid", color="black", weight=3];
10250[label="primPlusInt (Neg zx4600) (index00 (compare True zx3780 == GT))",fontsize=16,color="black",shape="box"];10250 -> 10284[label="",style="solid", color="black", weight=3];
10251[label="foldl' primPlusInt zx689 (index0 True zx37810 : map (index0 True) zx37811)",fontsize=16,color="black",shape="box"];10251 -> 10285[label="",style="solid", color="black", weight=3];
10252 -> 9590[label="",style="dashed", color="red", weight=0];
10252[label="foldl' primPlusInt zx689 []",fontsize=16,color="magenta"];10252 -> 10286[label="",style="dashed", color="magenta", weight=3];
8315[label="rangeSize1 EQ LT (null ((++) range40 GT (not (compare1 LT GT True == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];8315 -> 8462[label="",style="solid", color="black", weight=3];
8316[label="rangeSize1 GT LT (null ((++) range40 GT (not (compare1 LT GT True == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];8316 -> 8463[label="",style="solid", color="black", weight=3];
8317[label="rangeSize1 EQ EQ (null (EQ : [] ++ foldr (++) [] (map (range4 EQ EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8317 -> 8464[label="",style="solid", color="black", weight=3];
9155[label="(++) range40 EQ (not (LT == LT)) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];9155 -> 9301[label="",style="solid", color="black", weight=3];
8319[label="rangeSize1 EQ GT (null ((++) range40 EQ (not (EQ == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8319 -> 8466[label="",style="solid", color="black", weight=3];
8320[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare1 EQ GT (EQ <= GT) == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];8320 -> 8467[label="",style="solid", color="black", weight=3];
8321[label="rangeSize1 True True (null (True : [] ++ foldr (++) [] (map (range0 True True) [])))",fontsize=16,color="black",shape="box"];8321 -> 8468[label="",style="solid", color="black", weight=3];
8322[label="(++) range40 GT (LT >= GT && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];8322 -> 8469[label="",style="solid", color="black", weight=3];
8323[label="(++) range40 GT (LT >= GT && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];8323 -> 8470[label="",style="solid", color="black", weight=3];
8324[label="(++) range40 GT (LT >= GT && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];8324 -> 8471[label="",style="solid", color="black", weight=3];
8325[label="(++) range40 EQ (not (compare3 EQ LT == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];8325 -> 8472[label="",style="solid", color="black", weight=3];
8326[label="(++) range40 EQ (not (compare3 EQ EQ == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];8326 -> 8473[label="",style="solid", color="black", weight=3];
8328[label="(++) range40 EQ (True && EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];8328 -> 8475[label="",style="solid", color="black", weight=3];
8329[label="(++) range40 EQ (True && EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];8329 -> 8476[label="",style="solid", color="black", weight=3];
8330[label="(++) range40 EQ (True && EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];8330 -> 8477[label="",style="solid", color="black", weight=3];
8331[label="(++) range00 True (not (compare3 True False == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];8331 -> 8478[label="",style="solid", color="black", weight=3];
8332[label="(++) range00 True (not (compare3 True True == LT)) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];8332 -> 8479[label="",style="solid", color="black", weight=3];
9611[label="primPlusInt (Pos zx4740) (index10 (compare3 LT zx3600 == GT))",fontsize=16,color="black",shape="box"];9611 -> 9725[label="",style="solid", color="black", weight=3];
9612[label="primPlusInt (Neg zx4740) (index10 (compare3 LT zx3600 == GT))",fontsize=16,color="black",shape="box"];9612 -> 9726[label="",style="solid", color="black", weight=3];
9613 -> 9727[label="",style="dashed", color="red", weight=0];
9613[label="(foldl' primPlusInt $! primPlusInt zx663 (index1 LT zx36010))",fontsize=16,color="magenta"];9613 -> 9728[label="",style="dashed", color="magenta", weight=3];
9614[label="zx663",fontsize=16,color="green",shape="box"];9744[label="primPlusInt (Pos zx4550) (index10 (compare3 EQ zx3610 == GT))",fontsize=16,color="black",shape="box"];9744 -> 9776[label="",style="solid", color="black", weight=3];
9745[label="primPlusInt (Neg zx4550) (index10 (compare3 EQ zx3610 == GT))",fontsize=16,color="black",shape="box"];9745 -> 9777[label="",style="solid", color="black", weight=3];
9746 -> 9778[label="",style="dashed", color="red", weight=0];
9746[label="(foldl' primPlusInt $! primPlusInt zx667 (index1 EQ zx36110))",fontsize=16,color="magenta"];9746 -> 9779[label="",style="dashed", color="magenta", weight=3];
9747[label="zx667",fontsize=16,color="green",shape="box"];9793[label="primPlusInt (Pos zx4560) (index10 (compare3 GT zx3620 == GT))",fontsize=16,color="black",shape="box"];9793 -> 9891[label="",style="solid", color="black", weight=3];
9794[label="primPlusInt (Neg zx4560) (index10 (compare3 GT zx3620 == GT))",fontsize=16,color="black",shape="box"];9794 -> 9892[label="",style="solid", color="black", weight=3];
9795 -> 9893[label="",style="dashed", color="red", weight=0];
9795[label="(foldl' primPlusInt $! primPlusInt zx671 (index1 GT zx36210))",fontsize=16,color="magenta"];9795 -> 9894[label="",style="dashed", color="magenta", weight=3];
9796[label="zx671",fontsize=16,color="green",shape="box"];9958[label="primPlusInt (Pos zx4590) (index00 (compare3 False zx3640 == GT))",fontsize=16,color="black",shape="box"];9958 -> 10006[label="",style="solid", color="black", weight=3];
9959[label="primPlusInt (Neg zx4590) (index00 (compare3 False zx3640 == GT))",fontsize=16,color="black",shape="box"];9959 -> 10007[label="",style="solid", color="black", weight=3];
9960 -> 10008[label="",style="dashed", color="red", weight=0];
9960[label="(foldl' primPlusInt $! primPlusInt zx677 (index0 False zx36410))",fontsize=16,color="magenta"];9960 -> 10009[label="",style="dashed", color="magenta", weight=3];
9961[label="zx677",fontsize=16,color="green",shape="box"];10283[label="primPlusInt (Pos zx4600) (index00 (compare3 True zx3780 == GT))",fontsize=16,color="black",shape="box"];10283 -> 10303[label="",style="solid", color="black", weight=3];
10284[label="primPlusInt (Neg zx4600) (index00 (compare3 True zx3780 == GT))",fontsize=16,color="black",shape="box"];10284 -> 10304[label="",style="solid", color="black", weight=3];
10285 -> 10305[label="",style="dashed", color="red", weight=0];
10285[label="(foldl' primPlusInt $! primPlusInt zx689 (index0 True zx37810))",fontsize=16,color="magenta"];10285 -> 10306[label="",style="dashed", color="magenta", weight=3];
10286[label="zx689",fontsize=16,color="green",shape="box"];8462[label="rangeSize1 EQ LT (null ((++) range40 GT (not (LT == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];8462 -> 8655[label="",style="solid", color="black", weight=3];
8463[label="rangeSize1 GT LT (null ((++) range40 GT (not (LT == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];8463 -> 8656[label="",style="solid", color="black", weight=3];
8464[label="rangeSize1 EQ EQ False",fontsize=16,color="black",shape="box"];8464 -> 8657[label="",style="solid", color="black", weight=3];
9301[label="(++) range40 EQ (not True) foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];9301 -> 9352[label="",style="solid", color="black", weight=3];
8466[label="rangeSize1 EQ GT (null ((++) range40 EQ (not False) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8466 -> 8659[label="",style="solid", color="black", weight=3];
8467[label="rangeSize1 GT GT (null ((++) range40 EQ (not (compare1 EQ GT True == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];8467 -> 8660[label="",style="solid", color="black", weight=3];
8468[label="rangeSize1 True True False",fontsize=16,color="black",shape="box"];8468 -> 8661[label="",style="solid", color="black", weight=3];
8469[label="(++) range40 GT (compare LT GT /= LT && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];8469 -> 8662[label="",style="solid", color="black", weight=3];
8470[label="(++) range40 GT (compare LT GT /= LT && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];8470 -> 8663[label="",style="solid", color="black", weight=3];
8471[label="(++) range40 GT (compare LT GT /= LT && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];8471 -> 8664[label="",style="solid", color="black", weight=3];
8472[label="(++) range40 EQ (not (compare2 EQ LT (EQ == LT) == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];8472 -> 8665[label="",style="solid", color="black", weight=3];
8473[label="(++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];8473 -> 8666[label="",style="solid", color="black", weight=3];
8475[label="(++) range40 EQ (EQ >= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];8475 -> 8668[label="",style="solid", color="black", weight=3];
8476[label="(++) range40 EQ (EQ >= EQ) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];8476 -> 8669[label="",style="solid", color="black", weight=3];
8477[label="(++) range40 EQ (EQ >= GT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];8477 -> 8670[label="",style="solid", color="black", weight=3];
8478[label="(++) range00 True (not (compare2 True False (True == False) == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];8478 -> 8671[label="",style="solid", color="black", weight=3];
8479[label="(++) range00 True (not (compare2 True True (True == True) == LT)) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];8479 -> 8672[label="",style="solid", color="black", weight=3];
9725[label="primPlusInt (Pos zx4740) (index10 (compare2 LT zx3600 (LT == zx3600) == GT))",fontsize=16,color="burlywood",shape="box"];12041[label="zx3600/LT",fontsize=10,color="white",style="solid",shape="box"];9725 -> 12041[label="",style="solid", color="burlywood", weight=9];
12041 -> 9748[label="",style="solid", color="burlywood", weight=3];
12042[label="zx3600/EQ",fontsize=10,color="white",style="solid",shape="box"];9725 -> 12042[label="",style="solid", color="burlywood", weight=9];
12042 -> 9749[label="",style="solid", color="burlywood", weight=3];
12043[label="zx3600/GT",fontsize=10,color="white",style="solid",shape="box"];9725 -> 12043[label="",style="solid", color="burlywood", weight=9];
12043 -> 9750[label="",style="solid", color="burlywood", weight=3];
9726[label="primPlusInt (Neg zx4740) (index10 (compare2 LT zx3600 (LT == zx3600) == GT))",fontsize=16,color="burlywood",shape="box"];12044[label="zx3600/LT",fontsize=10,color="white",style="solid",shape="box"];9726 -> 12044[label="",style="solid", color="burlywood", weight=9];
12044 -> 9751[label="",style="solid", color="burlywood", weight=3];
12045[label="zx3600/EQ",fontsize=10,color="white",style="solid",shape="box"];9726 -> 12045[label="",style="solid", color="burlywood", weight=9];
12045 -> 9752[label="",style="solid", color="burlywood", weight=3];
12046[label="zx3600/GT",fontsize=10,color="white",style="solid",shape="box"];9726 -> 12046[label="",style="solid", color="burlywood", weight=9];
12046 -> 9753[label="",style="solid", color="burlywood", weight=3];
9728 -> 9383[label="",style="dashed", color="red", weight=0];
9728[label="primPlusInt zx663 (index1 LT zx36010)",fontsize=16,color="magenta"];9728 -> 9754[label="",style="dashed", color="magenta", weight=3];
9728 -> 9755[label="",style="dashed", color="magenta", weight=3];
9727[label="(foldl' primPlusInt $! zx673)",fontsize=16,color="black",shape="triangle"];9727 -> 9756[label="",style="solid", color="black", weight=3];
9776[label="primPlusInt (Pos zx4550) (index10 (compare2 EQ zx3610 (EQ == zx3610) == GT))",fontsize=16,color="burlywood",shape="box"];12048[label="zx3610/LT",fontsize=10,color="white",style="solid",shape="box"];9776 -> 12048[label="",style="solid", color="burlywood", weight=9];
12048 -> 9797[label="",style="solid", color="burlywood", weight=3];
12049[label="zx3610/EQ",fontsize=10,color="white",style="solid",shape="box"];9776 -> 12049[label="",style="solid", color="burlywood", weight=9];
12049 -> 9798[label="",style="solid", color="burlywood", weight=3];
12050[label="zx3610/GT",fontsize=10,color="white",style="solid",shape="box"];9776 -> 12050[label="",style="solid", color="burlywood", weight=9];
12050 -> 9799[label="",style="solid", color="burlywood", weight=3];
9777[label="primPlusInt (Neg zx4550) (index10 (compare2 EQ zx3610 (EQ == zx3610) == GT))",fontsize=16,color="burlywood",shape="box"];12051[label="zx3610/LT",fontsize=10,color="white",style="solid",shape="box"];9777 -> 12051[label="",style="solid", color="burlywood", weight=9];
12051 -> 9800[label="",style="solid", color="burlywood", weight=3];
12052[label="zx3610/EQ",fontsize=10,color="white",style="solid",shape="box"];9777 -> 12052[label="",style="solid", color="burlywood", weight=9];
12052 -> 9801[label="",style="solid", color="burlywood", weight=3];
12053[label="zx3610/GT",fontsize=10,color="white",style="solid",shape="box"];9777 -> 12053[label="",style="solid", color="burlywood", weight=9];
12053 -> 9802[label="",style="solid", color="burlywood", weight=3];
9779 -> 9490[label="",style="dashed", color="red", weight=0];
9779[label="primPlusInt zx667 (index1 EQ zx36110)",fontsize=16,color="magenta"];9779 -> 9803[label="",style="dashed", color="magenta", weight=3];
9779 -> 9804[label="",style="dashed", color="magenta", weight=3];
9778[label="(foldl' primPlusInt $! zx676)",fontsize=16,color="black",shape="triangle"];9778 -> 9805[label="",style="solid", color="black", weight=3];
9891[label="primPlusInt (Pos zx4560) (index10 (compare2 GT zx3620 (GT == zx3620) == GT))",fontsize=16,color="burlywood",shape="box"];12055[label="zx3620/LT",fontsize=10,color="white",style="solid",shape="box"];9891 -> 12055[label="",style="solid", color="burlywood", weight=9];
12055 -> 9966[label="",style="solid", color="burlywood", weight=3];
12056[label="zx3620/EQ",fontsize=10,color="white",style="solid",shape="box"];9891 -> 12056[label="",style="solid", color="burlywood", weight=9];
12056 -> 9967[label="",style="solid", color="burlywood", weight=3];
12057[label="zx3620/GT",fontsize=10,color="white",style="solid",shape="box"];9891 -> 12057[label="",style="solid", color="burlywood", weight=9];
12057 -> 9968[label="",style="solid", color="burlywood", weight=3];
9892[label="primPlusInt (Neg zx4560) (index10 (compare2 GT zx3620 (GT == zx3620) == GT))",fontsize=16,color="burlywood",shape="box"];12058[label="zx3620/LT",fontsize=10,color="white",style="solid",shape="box"];9892 -> 12058[label="",style="solid", color="burlywood", weight=9];
12058 -> 9969[label="",style="solid", color="burlywood", weight=3];
12059[label="zx3620/EQ",fontsize=10,color="white",style="solid",shape="box"];9892 -> 12059[label="",style="solid", color="burlywood", weight=9];
12059 -> 9970[label="",style="solid", color="burlywood", weight=3];
12060[label="zx3620/GT",fontsize=10,color="white",style="solid",shape="box"];9892 -> 12060[label="",style="solid", color="burlywood", weight=9];
12060 -> 9971[label="",style="solid", color="burlywood", weight=3];
9894 -> 9618[label="",style="dashed", color="red", weight=0];
9894[label="primPlusInt zx671 (index1 GT zx36210)",fontsize=16,color="magenta"];9894 -> 9972[label="",style="dashed", color="magenta", weight=3];
9894 -> 9973[label="",style="dashed", color="magenta", weight=3];
9893[label="(foldl' primPlusInt $! zx679)",fontsize=16,color="black",shape="triangle"];9893 -> 9974[label="",style="solid", color="black", weight=3];
10006[label="primPlusInt (Pos zx4590) (index00 (compare2 False zx3640 (False == zx3640) == GT))",fontsize=16,color="burlywood",shape="box"];12062[label="zx3640/False",fontsize=10,color="white",style="solid",shape="box"];10006 -> 12062[label="",style="solid", color="burlywood", weight=9];
12062 -> 10032[label="",style="solid", color="burlywood", weight=3];
12063[label="zx3640/True",fontsize=10,color="white",style="solid",shape="box"];10006 -> 12063[label="",style="solid", color="burlywood", weight=9];
12063 -> 10033[label="",style="solid", color="burlywood", weight=3];
10007[label="primPlusInt (Neg zx4590) (index00 (compare2 False zx3640 (False == zx3640) == GT))",fontsize=16,color="burlywood",shape="box"];12064[label="zx3640/False",fontsize=10,color="white",style="solid",shape="box"];10007 -> 12064[label="",style="solid", color="burlywood", weight=9];
12064 -> 10034[label="",style="solid", color="burlywood", weight=3];
12065[label="zx3640/True",fontsize=10,color="white",style="solid",shape="box"];10007 -> 12065[label="",style="solid", color="burlywood", weight=9];
12065 -> 10035[label="",style="solid", color="burlywood", weight=3];
10009 -> 9814[label="",style="dashed", color="red", weight=0];
10009[label="primPlusInt zx677 (index0 False zx36410)",fontsize=16,color="magenta"];10009 -> 10036[label="",style="dashed", color="magenta", weight=3];
10009 -> 10037[label="",style="dashed", color="magenta", weight=3];
10008[label="(foldl' primPlusInt $! zx688)",fontsize=16,color="black",shape="triangle"];10008 -> 10038[label="",style="solid", color="black", weight=3];
10303[label="primPlusInt (Pos zx4600) (index00 (compare2 True zx3780 (True == zx3780) == GT))",fontsize=16,color="burlywood",shape="box"];12067[label="zx3780/False",fontsize=10,color="white",style="solid",shape="box"];10303 -> 12067[label="",style="solid", color="burlywood", weight=9];
12067 -> 10310[label="",style="solid", color="burlywood", weight=3];
12068[label="zx3780/True",fontsize=10,color="white",style="solid",shape="box"];10303 -> 12068[label="",style="solid", color="burlywood", weight=9];
12068 -> 10311[label="",style="solid", color="burlywood", weight=3];
10304[label="primPlusInt (Neg zx4600) (index00 (compare2 True zx3780 (True == zx3780) == GT))",fontsize=16,color="burlywood",shape="box"];12069[label="zx3780/False",fontsize=10,color="white",style="solid",shape="box"];10304 -> 12069[label="",style="solid", color="burlywood", weight=9];
12069 -> 10312[label="",style="solid", color="burlywood", weight=3];
12070[label="zx3780/True",fontsize=10,color="white",style="solid",shape="box"];10304 -> 12070[label="",style="solid", color="burlywood", weight=9];
12070 -> 10313[label="",style="solid", color="burlywood", weight=3];
10306 -> 10063[label="",style="dashed", color="red", weight=0];
10306[label="primPlusInt zx689 (index0 True zx37810)",fontsize=16,color="magenta"];10306 -> 10314[label="",style="dashed", color="magenta", weight=3];
10306 -> 10315[label="",style="dashed", color="magenta", weight=3];
10305[label="(foldl' primPlusInt $! zx698)",fontsize=16,color="black",shape="triangle"];10305 -> 10316[label="",style="solid", color="black", weight=3];
8655[label="rangeSize1 EQ LT (null ((++) range40 GT (not True && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];8655 -> 8847[label="",style="solid", color="black", weight=3];
8656[label="rangeSize1 GT LT (null ((++) range40 GT (not True && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];8656 -> 8848[label="",style="solid", color="black", weight=3];
8657[label="rangeSize0 EQ EQ otherwise",fontsize=16,color="black",shape="box"];8657 -> 8849[label="",style="solid", color="black", weight=3];
9352[label="(++) range40 EQ False foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];9352 -> 10183[label="",style="solid", color="black", weight=3];
8659[label="rangeSize1 EQ GT (null ((++) range40 EQ True foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8659 -> 8851[label="",style="solid", color="black", weight=3];
8660[label="rangeSize1 GT GT (null ((++) range40 EQ (not (LT == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];8660 -> 8852[label="",style="solid", color="black", weight=3];
8661[label="rangeSize0 True True otherwise",fontsize=16,color="black",shape="box"];8661 -> 8853[label="",style="solid", color="black", weight=3];
8662[label="(++) range40 GT (not (compare LT GT == LT) && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];8662 -> 8854[label="",style="solid", color="black", weight=3];
8663[label="(++) range40 GT (not (compare LT GT == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];8663 -> 8855[label="",style="solid", color="black", weight=3];
8664[label="(++) range40 GT (not (compare LT GT == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];8664 -> 8856[label="",style="solid", color="black", weight=3];
8665[label="(++) range40 EQ (not (compare2 EQ LT False == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];8665 -> 8857[label="",style="solid", color="black", weight=3];
8666[label="(++) range40 EQ (not (compare2 EQ EQ True == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];8666 -> 8858[label="",style="solid", color="black", weight=3];
8668[label="(++) range40 EQ (compare EQ LT /= LT) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];8668 -> 8860[label="",style="solid", color="black", weight=3];
8669[label="(++) range40 EQ (compare EQ EQ /= LT) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];8669 -> 8861[label="",style="solid", color="black", weight=3];
8670[label="(++) range40 EQ (compare EQ GT /= LT) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];8670 -> 8862[label="",style="solid", color="black", weight=3];
8671[label="(++) range00 True (not (compare2 True False False == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];8671 -> 8863[label="",style="solid", color="black", weight=3];
8672[label="(++) range00 True (not (compare2 True True True == LT)) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];8672 -> 8864[label="",style="solid", color="black", weight=3];
9748[label="primPlusInt (Pos zx4740) (index10 (compare2 LT LT (LT == LT) == GT))",fontsize=16,color="black",shape="box"];9748 -> 9806[label="",style="solid", color="black", weight=3];
9749[label="primPlusInt (Pos zx4740) (index10 (compare2 LT EQ (LT == EQ) == GT))",fontsize=16,color="black",shape="box"];9749 -> 9807[label="",style="solid", color="black", weight=3];
9750[label="primPlusInt (Pos zx4740) (index10 (compare2 LT GT (LT == GT) == GT))",fontsize=16,color="black",shape="box"];9750 -> 9808[label="",style="solid", color="black", weight=3];
9751[label="primPlusInt (Neg zx4740) (index10 (compare2 LT LT (LT == LT) == GT))",fontsize=16,color="black",shape="box"];9751 -> 9809[label="",style="solid", color="black", weight=3];
9752[label="primPlusInt (Neg zx4740) (index10 (compare2 LT EQ (LT == EQ) == GT))",fontsize=16,color="black",shape="box"];9752 -> 9810[label="",style="solid", color="black", weight=3];
9753[label="primPlusInt (Neg zx4740) (index10 (compare2 LT GT (LT == GT) == GT))",fontsize=16,color="black",shape="box"];9753 -> 9811[label="",style="solid", color="black", weight=3];
9754[label="zx663",fontsize=16,color="green",shape="box"];9755[label="zx36010",fontsize=16,color="green",shape="box"];9756[label="(zx673 `seq` foldl' primPlusInt zx673)",fontsize=16,color="black",shape="box"];9756 -> 9812[label="",style="solid", color="black", weight=3];
9797[label="primPlusInt (Pos zx4550) (index10 (compare2 EQ LT (EQ == LT) == GT))",fontsize=16,color="black",shape="box"];9797 -> 9975[label="",style="solid", color="black", weight=3];
9798[label="primPlusInt (Pos zx4550) (index10 (compare2 EQ EQ (EQ == EQ) == GT))",fontsize=16,color="black",shape="box"];9798 -> 9976[label="",style="solid", color="black", weight=3];
9799[label="primPlusInt (Pos zx4550) (index10 (compare2 EQ GT (EQ == GT) == GT))",fontsize=16,color="black",shape="box"];9799 -> 9977[label="",style="solid", color="black", weight=3];
9800[label="primPlusInt (Neg zx4550) (index10 (compare2 EQ LT (EQ == LT) == GT))",fontsize=16,color="black",shape="box"];9800 -> 9978[label="",style="solid", color="black", weight=3];
9801[label="primPlusInt (Neg zx4550) (index10 (compare2 EQ EQ (EQ == EQ) == GT))",fontsize=16,color="black",shape="box"];9801 -> 9979[label="",style="solid", color="black", weight=3];
9802[label="primPlusInt (Neg zx4550) (index10 (compare2 EQ GT (EQ == GT) == GT))",fontsize=16,color="black",shape="box"];9802 -> 9980[label="",style="solid", color="black", weight=3];
9803[label="zx36110",fontsize=16,color="green",shape="box"];9804[label="zx667",fontsize=16,color="green",shape="box"];9805[label="(zx676 `seq` foldl' primPlusInt zx676)",fontsize=16,color="black",shape="box"];9805 -> 9981[label="",style="solid", color="black", weight=3];
9966[label="primPlusInt (Pos zx4560) (index10 (compare2 GT LT (GT == LT) == GT))",fontsize=16,color="black",shape="box"];9966 -> 10039[label="",style="solid", color="black", weight=3];
9967[label="primPlusInt (Pos zx4560) (index10 (compare2 GT EQ (GT == EQ) == GT))",fontsize=16,color="black",shape="box"];9967 -> 10040[label="",style="solid", color="black", weight=3];
9968[label="primPlusInt (Pos zx4560) (index10 (compare2 GT GT (GT == GT) == GT))",fontsize=16,color="black",shape="box"];9968 -> 10041[label="",style="solid", color="black", weight=3];
9969[label="primPlusInt (Neg zx4560) (index10 (compare2 GT LT (GT == LT) == GT))",fontsize=16,color="black",shape="box"];9969 -> 10042[label="",style="solid", color="black", weight=3];
9970[label="primPlusInt (Neg zx4560) (index10 (compare2 GT EQ (GT == EQ) == GT))",fontsize=16,color="black",shape="box"];9970 -> 10043[label="",style="solid", color="black", weight=3];
9971[label="primPlusInt (Neg zx4560) (index10 (compare2 GT GT (GT == GT) == GT))",fontsize=16,color="black",shape="box"];9971 -> 10044[label="",style="solid", color="black", weight=3];
9972[label="zx671",fontsize=16,color="green",shape="box"];9973[label="zx36210",fontsize=16,color="green",shape="box"];9974[label="(zx679 `seq` foldl' primPlusInt zx679)",fontsize=16,color="black",shape="box"];9974 -> 10045[label="",style="solid", color="black", weight=3];
10032[label="primPlusInt (Pos zx4590) (index00 (compare2 False False (False == False) == GT))",fontsize=16,color="black",shape="box"];10032 -> 10147[label="",style="solid", color="black", weight=3];
10033[label="primPlusInt (Pos zx4590) (index00 (compare2 False True (False == True) == GT))",fontsize=16,color="black",shape="box"];10033 -> 10148[label="",style="solid", color="black", weight=3];
10034[label="primPlusInt (Neg zx4590) (index00 (compare2 False False (False == False) == GT))",fontsize=16,color="black",shape="box"];10034 -> 10149[label="",style="solid", color="black", weight=3];
10035[label="primPlusInt (Neg zx4590) (index00 (compare2 False True (False == True) == GT))",fontsize=16,color="black",shape="box"];10035 -> 10150[label="",style="solid", color="black", weight=3];
10036[label="zx677",fontsize=16,color="green",shape="box"];10037[label="zx36410",fontsize=16,color="green",shape="box"];10038[label="(zx688 `seq` foldl' primPlusInt zx688)",fontsize=16,color="black",shape="box"];10038 -> 10151[label="",style="solid", color="black", weight=3];
10310[label="primPlusInt (Pos zx4600) (index00 (compare2 True False (True == False) == GT))",fontsize=16,color="black",shape="box"];10310 -> 10357[label="",style="solid", color="black", weight=3];
10311[label="primPlusInt (Pos zx4600) (index00 (compare2 True True (True == True) == GT))",fontsize=16,color="black",shape="box"];10311 -> 10358[label="",style="solid", color="black", weight=3];
10312[label="primPlusInt (Neg zx4600) (index00 (compare2 True False (True == False) == GT))",fontsize=16,color="black",shape="box"];10312 -> 10359[label="",style="solid", color="black", weight=3];
10313[label="primPlusInt (Neg zx4600) (index00 (compare2 True True (True == True) == GT))",fontsize=16,color="black",shape="box"];10313 -> 10360[label="",style="solid", color="black", weight=3];
10314[label="zx37810",fontsize=16,color="green",shape="box"];10315[label="zx689",fontsize=16,color="green",shape="box"];10316[label="(zx698 `seq` foldl' primPlusInt zx698)",fontsize=16,color="black",shape="box"];10316 -> 10361[label="",style="solid", color="black", weight=3];
8847[label="rangeSize1 EQ LT (null ((++) range40 GT (False && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];8847 -> 8994[label="",style="solid", color="black", weight=3];
8848[label="rangeSize1 GT LT (null ((++) range40 GT (False && GT >= GT) foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];8848 -> 8995[label="",style="solid", color="black", weight=3];
8849[label="rangeSize0 EQ EQ True",fontsize=16,color="black",shape="box"];8849 -> 8996[label="",style="solid", color="black", weight=3];
10183[label="(++) [] foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];10183 -> 10243[label="",style="solid", color="black", weight=3];
8851[label="rangeSize1 EQ GT (null ((++) (EQ : []) foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8851 -> 8998[label="",style="solid", color="black", weight=3];
8852[label="rangeSize1 GT GT (null ((++) range40 EQ (not True) foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];8852 -> 8999[label="",style="solid", color="black", weight=3];
8853[label="rangeSize0 True True True",fontsize=16,color="black",shape="box"];8853 -> 9000[label="",style="solid", color="black", weight=3];
8854[label="(++) range40 GT (not (compare3 LT GT == LT) && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];8854 -> 9001[label="",style="solid", color="black", weight=3];
8855[label="(++) range40 GT (not (compare3 LT GT == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];8855 -> 9002[label="",style="solid", color="black", weight=3];
8856[label="(++) range40 GT (not (compare3 LT GT == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];8856 -> 9003[label="",style="solid", color="black", weight=3];
8857[label="(++) range40 EQ (not (compare1 EQ LT (EQ <= LT) == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];8857 -> 9004[label="",style="solid", color="black", weight=3];
8858[label="(++) range40 EQ (not (EQ == LT)) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];8858 -> 9005[label="",style="solid", color="black", weight=3];
8860[label="(++) range40 EQ (not (compare EQ LT == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];8860 -> 9007[label="",style="solid", color="black", weight=3];
8861[label="(++) range40 EQ (not (compare EQ EQ == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];8861 -> 9008[label="",style="solid", color="black", weight=3];
8862[label="(++) range40 EQ (not (compare EQ GT == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];8862 -> 9009[label="",style="solid", color="black", weight=3];
8863[label="(++) range00 True (not (compare1 True False (True <= False) == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];8863 -> 9010[label="",style="solid", color="black", weight=3];
8864[label="(++) range00 True (not (EQ == LT)) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];8864 -> 9011[label="",style="solid", color="black", weight=3];
9806[label="primPlusInt (Pos zx4740) (index10 (compare2 LT LT True == GT))",fontsize=16,color="black",shape="box"];9806 -> 9982[label="",style="solid", color="black", weight=3];
9807[label="primPlusInt (Pos zx4740) (index10 (compare2 LT EQ False == GT))",fontsize=16,color="black",shape="box"];9807 -> 9983[label="",style="solid", color="black", weight=3];
9808[label="primPlusInt (Pos zx4740) (index10 (compare2 LT GT False == GT))",fontsize=16,color="black",shape="box"];9808 -> 9984[label="",style="solid", color="black", weight=3];
9809[label="primPlusInt (Neg zx4740) (index10 (compare2 LT LT True == GT))",fontsize=16,color="black",shape="box"];9809 -> 9985[label="",style="solid", color="black", weight=3];
9810[label="primPlusInt (Neg zx4740) (index10 (compare2 LT EQ False == GT))",fontsize=16,color="black",shape="box"];9810 -> 9986[label="",style="solid", color="black", weight=3];
9811[label="primPlusInt (Neg zx4740) (index10 (compare2 LT GT False == GT))",fontsize=16,color="black",shape="box"];9811 -> 9987[label="",style="solid", color="black", weight=3];
9812 -> 9382[label="",style="dashed", color="red", weight=0];
9812[label="enforceWHNF (WHNF zx673) (foldl' primPlusInt zx673) (map (index1 LT) zx36011)",fontsize=16,color="magenta"];9812 -> 9988[label="",style="dashed", color="magenta", weight=3];
9812 -> 9989[label="",style="dashed", color="magenta", weight=3];
9812 -> 9990[label="",style="dashed", color="magenta", weight=3];
9975[label="primPlusInt (Pos zx4550) (index10 (compare2 EQ LT False == GT))",fontsize=16,color="black",shape="box"];9975 -> 10046[label="",style="solid", color="black", weight=3];
9976[label="primPlusInt (Pos zx4550) (index10 (compare2 EQ EQ True == GT))",fontsize=16,color="black",shape="box"];9976 -> 10047[label="",style="solid", color="black", weight=3];
9977[label="primPlusInt (Pos zx4550) (index10 (compare2 EQ GT False == GT))",fontsize=16,color="black",shape="box"];9977 -> 10048[label="",style="solid", color="black", weight=3];
9978[label="primPlusInt (Neg zx4550) (index10 (compare2 EQ LT False == GT))",fontsize=16,color="black",shape="box"];9978 -> 10049[label="",style="solid", color="black", weight=3];
9979[label="primPlusInt (Neg zx4550) (index10 (compare2 EQ EQ True == GT))",fontsize=16,color="black",shape="box"];9979 -> 10050[label="",style="solid", color="black", weight=3];
9980[label="primPlusInt (Neg zx4550) (index10 (compare2 EQ GT False == GT))",fontsize=16,color="black",shape="box"];9980 -> 10051[label="",style="solid", color="black", weight=3];
9981 -> 9489[label="",style="dashed", color="red", weight=0];
9981[label="enforceWHNF (WHNF zx676) (foldl' primPlusInt zx676) (map (index1 EQ) zx36111)",fontsize=16,color="magenta"];9981 -> 10052[label="",style="dashed", color="magenta", weight=3];
9981 -> 10053[label="",style="dashed", color="magenta", weight=3];
9981 -> 10054[label="",style="dashed", color="magenta", weight=3];
10039[label="primPlusInt (Pos zx4560) (index10 (compare2 GT LT False == GT))",fontsize=16,color="black",shape="box"];10039 -> 10152[label="",style="solid", color="black", weight=3];
10040[label="primPlusInt (Pos zx4560) (index10 (compare2 GT EQ False == GT))",fontsize=16,color="black",shape="box"];10040 -> 10153[label="",style="solid", color="black", weight=3];
10041[label="primPlusInt (Pos zx4560) (index10 (compare2 GT GT True == GT))",fontsize=16,color="black",shape="box"];10041 -> 10154[label="",style="solid", color="black", weight=3];
10042[label="primPlusInt (Neg zx4560) (index10 (compare2 GT LT False == GT))",fontsize=16,color="black",shape="box"];10042 -> 10155[label="",style="solid", color="black", weight=3];
10043[label="primPlusInt (Neg zx4560) (index10 (compare2 GT EQ False == GT))",fontsize=16,color="black",shape="box"];10043 -> 10156[label="",style="solid", color="black", weight=3];
10044[label="primPlusInt (Neg zx4560) (index10 (compare2 GT GT True == GT))",fontsize=16,color="black",shape="box"];10044 -> 10157[label="",style="solid", color="black", weight=3];
10045 -> 9617[label="",style="dashed", color="red", weight=0];
10045[label="enforceWHNF (WHNF zx679) (foldl' primPlusInt zx679) (map (index1 GT) zx36211)",fontsize=16,color="magenta"];10045 -> 10158[label="",style="dashed", color="magenta", weight=3];
10045 -> 10159[label="",style="dashed", color="magenta", weight=3];
10045 -> 10160[label="",style="dashed", color="magenta", weight=3];
10147[label="primPlusInt (Pos zx4590) (index00 (compare2 False False True == GT))",fontsize=16,color="black",shape="box"];10147 -> 10212[label="",style="solid", color="black", weight=3];
10148[label="primPlusInt (Pos zx4590) (index00 (compare2 False True False == GT))",fontsize=16,color="black",shape="box"];10148 -> 10213[label="",style="solid", color="black", weight=3];
10149[label="primPlusInt (Neg zx4590) (index00 (compare2 False False True == GT))",fontsize=16,color="black",shape="box"];10149 -> 10214[label="",style="solid", color="black", weight=3];
10150[label="primPlusInt (Neg zx4590) (index00 (compare2 False True False == GT))",fontsize=16,color="black",shape="box"];10150 -> 10215[label="",style="solid", color="black", weight=3];
10151 -> 9813[label="",style="dashed", color="red", weight=0];
10151[label="enforceWHNF (WHNF zx688) (foldl' primPlusInt zx688) (map (index0 False) zx36411)",fontsize=16,color="magenta"];10151 -> 10216[label="",style="dashed", color="magenta", weight=3];
10151 -> 10217[label="",style="dashed", color="magenta", weight=3];
10151 -> 10218[label="",style="dashed", color="magenta", weight=3];
10357[label="primPlusInt (Pos zx4600) (index00 (compare2 True False False == GT))",fontsize=16,color="black",shape="box"];10357 -> 10401[label="",style="solid", color="black", weight=3];
10358[label="primPlusInt (Pos zx4600) (index00 (compare2 True True True == GT))",fontsize=16,color="black",shape="box"];10358 -> 10402[label="",style="solid", color="black", weight=3];
10359[label="primPlusInt (Neg zx4600) (index00 (compare2 True False False == GT))",fontsize=16,color="black",shape="box"];10359 -> 10403[label="",style="solid", color="black", weight=3];
10360[label="primPlusInt (Neg zx4600) (index00 (compare2 True True True == GT))",fontsize=16,color="black",shape="box"];10360 -> 10404[label="",style="solid", color="black", weight=3];
10361 -> 10062[label="",style="dashed", color="red", weight=0];
10361[label="enforceWHNF (WHNF zx698) (foldl' primPlusInt zx698) (map (index0 True) zx37811)",fontsize=16,color="magenta"];10361 -> 10405[label="",style="dashed", color="magenta", weight=3];
10361 -> 10406[label="",style="dashed", color="magenta", weight=3];
10361 -> 10407[label="",style="dashed", color="magenta", weight=3];
8994[label="rangeSize1 EQ LT (null ((++) range40 GT False foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];8994 -> 9143[label="",style="solid", color="black", weight=3];
8995[label="rangeSize1 GT LT (null ((++) range40 GT False foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];8995 -> 9144[label="",style="solid", color="black", weight=3];
8996 -> 1381[label="",style="dashed", color="red", weight=0];
8996[label="index (EQ,EQ) EQ + Pos (Succ Zero)",fontsize=16,color="magenta"];8996 -> 9145[label="",style="dashed", color="magenta", weight=3];
10243[label="foldr (++) [] (map (range4 EQ GT) (GT : []))",fontsize=16,color="black",shape="box"];10243 -> 10349[label="",style="solid", color="black", weight=3];
8998[label="rangeSize1 EQ GT (null (EQ : [] ++ foldr (++) [] (map (range4 GT EQ) (GT : []))))",fontsize=16,color="black",shape="box"];8998 -> 9147[label="",style="solid", color="black", weight=3];
8999[label="rangeSize1 GT GT (null ((++) range40 EQ False foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];8999 -> 9148[label="",style="solid", color="black", weight=3];
9000 -> 1381[label="",style="dashed", color="red", weight=0];
9000[label="index (True,True) True + Pos (Succ Zero)",fontsize=16,color="magenta"];9000 -> 9149[label="",style="dashed", color="magenta", weight=3];
9001[label="(++) range40 GT (not (compare2 LT GT (LT == GT) == LT) && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];9001 -> 9150[label="",style="solid", color="black", weight=3];
9002[label="(++) range40 GT (not (compare2 LT GT (LT == GT) == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];9002 -> 9151[label="",style="solid", color="black", weight=3];
9003[label="(++) range40 GT (not (compare2 LT GT (LT == GT) == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];9003 -> 9152[label="",style="solid", color="black", weight=3];
9004[label="(++) range40 EQ (not (compare1 EQ LT False == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];9004 -> 9153[label="",style="solid", color="black", weight=3];
9005[label="(++) range40 EQ (not False) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];9005 -> 9154[label="",style="solid", color="black", weight=3];
9007[label="(++) range40 EQ (not (compare3 EQ LT == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];9007 -> 9156[label="",style="solid", color="black", weight=3];
9008[label="(++) range40 EQ (not (compare3 EQ EQ == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];9008 -> 9157[label="",style="solid", color="black", weight=3];
9009[label="(++) range40 EQ (not (compare3 EQ GT == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];9009 -> 9158[label="",style="solid", color="black", weight=3];
9010[label="(++) range00 True (not (compare1 True False False == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];9010 -> 9159[label="",style="solid", color="black", weight=3];
9011[label="(++) range00 True (not False) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];9011 -> 9160[label="",style="solid", color="black", weight=3];
9982[label="primPlusInt (Pos zx4740) (index10 (EQ == GT))",fontsize=16,color="black",shape="triangle"];9982 -> 10055[label="",style="solid", color="black", weight=3];
9983[label="primPlusInt (Pos zx4740) (index10 (compare1 LT EQ (LT <= EQ) == GT))",fontsize=16,color="black",shape="box"];9983 -> 10056[label="",style="solid", color="black", weight=3];
9984[label="primPlusInt (Pos zx4740) (index10 (compare1 LT GT (LT <= GT) == GT))",fontsize=16,color="black",shape="box"];9984 -> 10057[label="",style="solid", color="black", weight=3];
9985[label="primPlusInt (Neg zx4740) (index10 (EQ == GT))",fontsize=16,color="black",shape="triangle"];9985 -> 10058[label="",style="solid", color="black", weight=3];
9986[label="primPlusInt (Neg zx4740) (index10 (compare1 LT EQ (LT <= EQ) == GT))",fontsize=16,color="black",shape="box"];9986 -> 10059[label="",style="solid", color="black", weight=3];
9987[label="primPlusInt (Neg zx4740) (index10 (compare1 LT GT (LT <= GT) == GT))",fontsize=16,color="black",shape="box"];9987 -> 10060[label="",style="solid", color="black", weight=3];
9988[label="zx673",fontsize=16,color="green",shape="box"];9989[label="zx36011",fontsize=16,color="green",shape="box"];9990[label="zx673",fontsize=16,color="green",shape="box"];10046[label="primPlusInt (Pos zx4550) (index10 (compare1 EQ LT (EQ <= LT) == GT))",fontsize=16,color="black",shape="box"];10046 -> 10161[label="",style="solid", color="black", weight=3];
10047 -> 9982[label="",style="dashed", color="red", weight=0];
10047[label="primPlusInt (Pos zx4550) (index10 (EQ == GT))",fontsize=16,color="magenta"];10047 -> 10162[label="",style="dashed", color="magenta", weight=3];
10048[label="primPlusInt (Pos zx4550) (index10 (compare1 EQ GT (EQ <= GT) == GT))",fontsize=16,color="black",shape="box"];10048 -> 10163[label="",style="solid", color="black", weight=3];
10049[label="primPlusInt (Neg zx4550) (index10 (compare1 EQ LT (EQ <= LT) == GT))",fontsize=16,color="black",shape="box"];10049 -> 10164[label="",style="solid", color="black", weight=3];
10050 -> 9985[label="",style="dashed", color="red", weight=0];
10050[label="primPlusInt (Neg zx4550) (index10 (EQ == GT))",fontsize=16,color="magenta"];10050 -> 10165[label="",style="dashed", color="magenta", weight=3];
10051[label="primPlusInt (Neg zx4550) (index10 (compare1 EQ GT (EQ <= GT) == GT))",fontsize=16,color="black",shape="box"];10051 -> 10166[label="",style="solid", color="black", weight=3];
10052[label="zx676",fontsize=16,color="green",shape="box"];10053[label="zx676",fontsize=16,color="green",shape="box"];10054[label="zx36111",fontsize=16,color="green",shape="box"];10152[label="primPlusInt (Pos zx4560) (index10 (compare1 GT LT (GT <= LT) == GT))",fontsize=16,color="black",shape="box"];10152 -> 10219[label="",style="solid", color="black", weight=3];
10153[label="primPlusInt (Pos zx4560) (index10 (compare1 GT EQ (GT <= EQ) == GT))",fontsize=16,color="black",shape="box"];10153 -> 10220[label="",style="solid", color="black", weight=3];
10154 -> 9982[label="",style="dashed", color="red", weight=0];
10154[label="primPlusInt (Pos zx4560) (index10 (EQ == GT))",fontsize=16,color="magenta"];10154 -> 10221[label="",style="dashed", color="magenta", weight=3];
10155[label="primPlusInt (Neg zx4560) (index10 (compare1 GT LT (GT <= LT) == GT))",fontsize=16,color="black",shape="box"];10155 -> 10222[label="",style="solid", color="black", weight=3];
10156[label="primPlusInt (Neg zx4560) (index10 (compare1 GT EQ (GT <= EQ) == GT))",fontsize=16,color="black",shape="box"];10156 -> 10223[label="",style="solid", color="black", weight=3];
10157 -> 9985[label="",style="dashed", color="red", weight=0];
10157[label="primPlusInt (Neg zx4560) (index10 (EQ == GT))",fontsize=16,color="magenta"];10157 -> 10224[label="",style="dashed", color="magenta", weight=3];
10158[label="zx36211",fontsize=16,color="green",shape="box"];10159[label="zx679",fontsize=16,color="green",shape="box"];10160[label="zx679",fontsize=16,color="green",shape="box"];10212[label="primPlusInt (Pos zx4590) (index00 (EQ == GT))",fontsize=16,color="black",shape="triangle"];10212 -> 10323[label="",style="solid", color="black", weight=3];
10213[label="primPlusInt (Pos zx4590) (index00 (compare1 False True (False <= True) == GT))",fontsize=16,color="black",shape="box"];10213 -> 10324[label="",style="solid", color="black", weight=3];
10214[label="primPlusInt (Neg zx4590) (index00 (EQ == GT))",fontsize=16,color="black",shape="triangle"];10214 -> 10325[label="",style="solid", color="black", weight=3];
10215[label="primPlusInt (Neg zx4590) (index00 (compare1 False True (False <= True) == GT))",fontsize=16,color="black",shape="box"];10215 -> 10326[label="",style="solid", color="black", weight=3];
10216[label="zx688",fontsize=16,color="green",shape="box"];10217[label="zx688",fontsize=16,color="green",shape="box"];10218[label="zx36411",fontsize=16,color="green",shape="box"];10401[label="primPlusInt (Pos zx4600) (index00 (compare1 True False (True <= False) == GT))",fontsize=16,color="black",shape="box"];10401 -> 10447[label="",style="solid", color="black", weight=3];
10402 -> 10212[label="",style="dashed", color="red", weight=0];
10402[label="primPlusInt (Pos zx4600) (index00 (EQ == GT))",fontsize=16,color="magenta"];10402 -> 10448[label="",style="dashed", color="magenta", weight=3];
10403[label="primPlusInt (Neg zx4600) (index00 (compare1 True False (True <= False) == GT))",fontsize=16,color="black",shape="box"];10403 -> 10449[label="",style="solid", color="black", weight=3];
10404 -> 10214[label="",style="dashed", color="red", weight=0];
10404[label="primPlusInt (Neg zx4600) (index00 (EQ == GT))",fontsize=16,color="magenta"];10404 -> 10450[label="",style="dashed", color="magenta", weight=3];
10405[label="zx698",fontsize=16,color="green",shape="box"];10406[label="zx37811",fontsize=16,color="green",shape="box"];10407[label="zx698",fontsize=16,color="green",shape="box"];9143[label="rangeSize1 EQ LT (null ((++) [] foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];9143 -> 9287[label="",style="solid", color="black", weight=3];
9144[label="rangeSize1 GT LT (null ((++) [] foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];9144 -> 9288[label="",style="solid", color="black", weight=3];
9145 -> 1667[label="",style="dashed", color="red", weight=0];
9145[label="index (EQ,EQ) EQ",fontsize=16,color="magenta"];9145 -> 9289[label="",style="dashed", color="magenta", weight=3];
9145 -> 9290[label="",style="dashed", color="magenta", weight=3];
10349[label="foldr (++) [] (range4 EQ GT GT : map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10349 -> 10474[label="",style="solid", color="black", weight=3];
9147[label="rangeSize1 EQ GT False",fontsize=16,color="black",shape="box"];9147 -> 9292[label="",style="solid", color="black", weight=3];
9148[label="rangeSize1 GT GT (null ((++) [] foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];9148 -> 9293[label="",style="solid", color="black", weight=3];
9149 -> 1668[label="",style="dashed", color="red", weight=0];
9149[label="index (True,True) True",fontsize=16,color="magenta"];9149 -> 9294[label="",style="dashed", color="magenta", weight=3];
9149 -> 9295[label="",style="dashed", color="magenta", weight=3];
9150[label="(++) range40 GT (not (compare2 LT GT False == LT) && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];9150 -> 9296[label="",style="solid", color="black", weight=3];
9151[label="(++) range40 GT (not (compare2 LT GT False == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];9151 -> 9297[label="",style="solid", color="black", weight=3];
9152[label="(++) range40 GT (not (compare2 LT GT False == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];9152 -> 9298[label="",style="solid", color="black", weight=3];
9153[label="(++) range40 EQ (not (compare0 EQ LT otherwise == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];9153 -> 9299[label="",style="solid", color="black", weight=3];
9154[label="(++) range40 EQ True foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];9154 -> 9300[label="",style="solid", color="black", weight=3];
9156[label="(++) range40 EQ (not (compare2 EQ LT (EQ == LT) == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];9156 -> 9302[label="",style="solid", color="black", weight=3];
9157[label="(++) range40 EQ (not (compare2 EQ EQ (EQ == EQ) == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];9157 -> 9303[label="",style="solid", color="black", weight=3];
9158[label="(++) range40 EQ (not (compare2 EQ GT (EQ == GT) == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];9158 -> 9304[label="",style="solid", color="black", weight=3];
9159[label="(++) range00 True (not (compare0 True False otherwise == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];9159 -> 9305[label="",style="solid", color="black", weight=3];
9160[label="(++) range00 True True foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];9160 -> 9306[label="",style="solid", color="black", weight=3];
10055[label="primPlusInt (Pos zx4740) (index10 False)",fontsize=16,color="black",shape="triangle"];10055 -> 10167[label="",style="solid", color="black", weight=3];
10056[label="primPlusInt (Pos zx4740) (index10 (compare1 LT EQ True == GT))",fontsize=16,color="black",shape="box"];10056 -> 10168[label="",style="solid", color="black", weight=3];
10057[label="primPlusInt (Pos zx4740) (index10 (compare1 LT GT True == GT))",fontsize=16,color="black",shape="box"];10057 -> 10169[label="",style="solid", color="black", weight=3];
10058[label="primPlusInt (Neg zx4740) (index10 False)",fontsize=16,color="black",shape="triangle"];10058 -> 10170[label="",style="solid", color="black", weight=3];
10059[label="primPlusInt (Neg zx4740) (index10 (compare1 LT EQ True == GT))",fontsize=16,color="black",shape="box"];10059 -> 10171[label="",style="solid", color="black", weight=3];
10060[label="primPlusInt (Neg zx4740) (index10 (compare1 LT GT True == GT))",fontsize=16,color="black",shape="box"];10060 -> 10172[label="",style="solid", color="black", weight=3];
10161[label="primPlusInt (Pos zx4550) (index10 (compare1 EQ LT False == GT))",fontsize=16,color="black",shape="box"];10161 -> 10225[label="",style="solid", color="black", weight=3];
10162[label="zx4550",fontsize=16,color="green",shape="box"];10163[label="primPlusInt (Pos zx4550) (index10 (compare1 EQ GT True == GT))",fontsize=16,color="black",shape="box"];10163 -> 10226[label="",style="solid", color="black", weight=3];
10164[label="primPlusInt (Neg zx4550) (index10 (compare1 EQ LT False == GT))",fontsize=16,color="black",shape="box"];10164 -> 10227[label="",style="solid", color="black", weight=3];
10165[label="zx4550",fontsize=16,color="green",shape="box"];10166[label="primPlusInt (Neg zx4550) (index10 (compare1 EQ GT True == GT))",fontsize=16,color="black",shape="box"];10166 -> 10228[label="",style="solid", color="black", weight=3];
10219[label="primPlusInt (Pos zx4560) (index10 (compare1 GT LT False == GT))",fontsize=16,color="black",shape="box"];10219 -> 10327[label="",style="solid", color="black", weight=3];
10220[label="primPlusInt (Pos zx4560) (index10 (compare1 GT EQ False == GT))",fontsize=16,color="black",shape="box"];10220 -> 10328[label="",style="solid", color="black", weight=3];
10221[label="zx4560",fontsize=16,color="green",shape="box"];10222[label="primPlusInt (Neg zx4560) (index10 (compare1 GT LT False == GT))",fontsize=16,color="black",shape="box"];10222 -> 10329[label="",style="solid", color="black", weight=3];
10223[label="primPlusInt (Neg zx4560) (index10 (compare1 GT EQ False == GT))",fontsize=16,color="black",shape="box"];10223 -> 10330[label="",style="solid", color="black", weight=3];
10224[label="zx4560",fontsize=16,color="green",shape="box"];10323[label="primPlusInt (Pos zx4590) (index00 False)",fontsize=16,color="black",shape="triangle"];10323 -> 10455[label="",style="solid", color="black", weight=3];
10324[label="primPlusInt (Pos zx4590) (index00 (compare1 False True True == GT))",fontsize=16,color="black",shape="box"];10324 -> 10456[label="",style="solid", color="black", weight=3];
10325[label="primPlusInt (Neg zx4590) (index00 False)",fontsize=16,color="black",shape="triangle"];10325 -> 10457[label="",style="solid", color="black", weight=3];
10326[label="primPlusInt (Neg zx4590) (index00 (compare1 False True True == GT))",fontsize=16,color="black",shape="box"];10326 -> 10458[label="",style="solid", color="black", weight=3];
10447[label="primPlusInt (Pos zx4600) (index00 (compare1 True False False == GT))",fontsize=16,color="black",shape="box"];10447 -> 10486[label="",style="solid", color="black", weight=3];
10448[label="zx4600",fontsize=16,color="green",shape="box"];10449[label="primPlusInt (Neg zx4600) (index00 (compare1 True False False == GT))",fontsize=16,color="black",shape="box"];10449 -> 10487[label="",style="solid", color="black", weight=3];
10450[label="zx4600",fontsize=16,color="green",shape="box"];9287[label="rangeSize1 EQ LT (null (foldr (++) [] (map (range4 LT EQ) [])))",fontsize=16,color="black",shape="box"];9287 -> 9342[label="",style="solid", color="black", weight=3];
9288[label="rangeSize1 GT LT (null (foldr (++) [] (map (range4 LT GT) [])))",fontsize=16,color="black",shape="box"];9288 -> 9343[label="",style="solid", color="black", weight=3];
9289[label="EQ",fontsize=16,color="green",shape="box"];9290[label="EQ",fontsize=16,color="green",shape="box"];10474[label="(++) range4 EQ GT GT foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10474 -> 10507[label="",style="solid", color="black", weight=3];
9292[label="rangeSize0 EQ GT otherwise",fontsize=16,color="black",shape="box"];9292 -> 9345[label="",style="solid", color="black", weight=3];
9293[label="rangeSize1 GT GT (null (foldr (++) [] (map (range4 GT GT) (GT : []))))",fontsize=16,color="black",shape="box"];9293 -> 9346[label="",style="solid", color="black", weight=3];
9294[label="True",fontsize=16,color="green",shape="box"];9295[label="True",fontsize=16,color="green",shape="box"];9296[label="(++) range40 GT (not (compare1 LT GT (LT <= GT) == LT) && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];9296 -> 9347[label="",style="solid", color="black", weight=3];
9297[label="(++) range40 GT (not (compare1 LT GT (LT <= GT) == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];9297 -> 9348[label="",style="solid", color="black", weight=3];
9298[label="(++) range40 GT (not (compare1 LT GT (LT <= GT) == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];9298 -> 9349[label="",style="solid", color="black", weight=3];
9299[label="(++) range40 EQ (not (compare0 EQ LT True == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];9299 -> 9350[label="",style="solid", color="black", weight=3];
9300[label="(++) (EQ : []) foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];9300 -> 9351[label="",style="solid", color="black", weight=3];
9302[label="(++) range40 EQ (not (compare2 EQ LT False == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];9302 -> 9353[label="",style="solid", color="black", weight=3];
9303[label="(++) range40 EQ (not (compare2 EQ EQ True == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];9303 -> 9354[label="",style="solid", color="black", weight=3];
9304[label="(++) range40 EQ (not (compare2 EQ GT False == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];9304 -> 9355[label="",style="solid", color="black", weight=3];
9305[label="(++) range00 True (not (compare0 True False True == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];9305 -> 9356[label="",style="solid", color="black", weight=3];
9306[label="(++) (True : []) foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];9306 -> 9357[label="",style="solid", color="black", weight=3];
10167[label="primPlusInt (Pos zx4740) (Pos Zero)",fontsize=16,color="black",shape="triangle"];10167 -> 10229[label="",style="solid", color="black", weight=3];
10168[label="primPlusInt (Pos zx4740) (index10 (LT == GT))",fontsize=16,color="black",shape="triangle"];10168 -> 10230[label="",style="solid", color="black", weight=3];
10169 -> 10168[label="",style="dashed", color="red", weight=0];
10169[label="primPlusInt (Pos zx4740) (index10 (LT == GT))",fontsize=16,color="magenta"];10170[label="primPlusInt (Neg zx4740) (Pos Zero)",fontsize=16,color="black",shape="triangle"];10170 -> 10231[label="",style="solid", color="black", weight=3];
10171[label="primPlusInt (Neg zx4740) (index10 (LT == GT))",fontsize=16,color="black",shape="triangle"];10171 -> 10232[label="",style="solid", color="black", weight=3];
10172 -> 10171[label="",style="dashed", color="red", weight=0];
10172[label="primPlusInt (Neg zx4740) (index10 (LT == GT))",fontsize=16,color="magenta"];10225[label="primPlusInt (Pos zx4550) (index10 (compare0 EQ LT otherwise == GT))",fontsize=16,color="black",shape="box"];10225 -> 10331[label="",style="solid", color="black", weight=3];
10226 -> 10168[label="",style="dashed", color="red", weight=0];
10226[label="primPlusInt (Pos zx4550) (index10 (LT == GT))",fontsize=16,color="magenta"];10226 -> 10332[label="",style="dashed", color="magenta", weight=3];
10227[label="primPlusInt (Neg zx4550) (index10 (compare0 EQ LT otherwise == GT))",fontsize=16,color="black",shape="box"];10227 -> 10333[label="",style="solid", color="black", weight=3];
10228 -> 10171[label="",style="dashed", color="red", weight=0];
10228[label="primPlusInt (Neg zx4550) (index10 (LT == GT))",fontsize=16,color="magenta"];10228 -> 10334[label="",style="dashed", color="magenta", weight=3];
10327[label="primPlusInt (Pos zx4560) (index10 (compare0 GT LT otherwise == GT))",fontsize=16,color="black",shape="box"];10327 -> 10459[label="",style="solid", color="black", weight=3];
10328[label="primPlusInt (Pos zx4560) (index10 (compare0 GT EQ otherwise == GT))",fontsize=16,color="black",shape="box"];10328 -> 10460[label="",style="solid", color="black", weight=3];
10329[label="primPlusInt (Neg zx4560) (index10 (compare0 GT LT otherwise == GT))",fontsize=16,color="black",shape="box"];10329 -> 10461[label="",style="solid", color="black", weight=3];
10330[label="primPlusInt (Neg zx4560) (index10 (compare0 GT EQ otherwise == GT))",fontsize=16,color="black",shape="box"];10330 -> 10462[label="",style="solid", color="black", weight=3];
10455 -> 10167[label="",style="dashed", color="red", weight=0];
10455[label="primPlusInt (Pos zx4590) (Pos Zero)",fontsize=16,color="magenta"];10455 -> 10490[label="",style="dashed", color="magenta", weight=3];
10456[label="primPlusInt (Pos zx4590) (index00 (LT == GT))",fontsize=16,color="black",shape="box"];10456 -> 10491[label="",style="solid", color="black", weight=3];
10457 -> 10170[label="",style="dashed", color="red", weight=0];
10457[label="primPlusInt (Neg zx4590) (Pos Zero)",fontsize=16,color="magenta"];10457 -> 10492[label="",style="dashed", color="magenta", weight=3];
10458[label="primPlusInt (Neg zx4590) (index00 (LT == GT))",fontsize=16,color="black",shape="box"];10458 -> 10493[label="",style="solid", color="black", weight=3];
10486[label="primPlusInt (Pos zx4600) (index00 (compare0 True False otherwise == GT))",fontsize=16,color="black",shape="box"];10486 -> 10517[label="",style="solid", color="black", weight=3];
10487[label="primPlusInt (Neg zx4600) (index00 (compare0 True False otherwise == GT))",fontsize=16,color="black",shape="box"];10487 -> 10518[label="",style="solid", color="black", weight=3];
9342[label="rangeSize1 EQ LT (null (foldr (++) [] []))",fontsize=16,color="black",shape="box"];9342 -> 10173[label="",style="solid", color="black", weight=3];
9343[label="rangeSize1 GT LT (null (foldr (++) [] []))",fontsize=16,color="black",shape="box"];9343 -> 10174[label="",style="solid", color="black", weight=3];
10507[label="(++) range40 GT (EQ >= GT && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10507 -> 10569[label="",style="solid", color="black", weight=3];
9345[label="rangeSize0 EQ GT True",fontsize=16,color="black",shape="box"];9345 -> 10176[label="",style="solid", color="black", weight=3];
9346[label="rangeSize1 GT GT (null (foldr (++) [] (range4 GT GT GT : map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];9346 -> 10177[label="",style="solid", color="black", weight=3];
9347[label="(++) range40 GT (not (compare1 LT GT True == LT) && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];9347 -> 10178[label="",style="solid", color="black", weight=3];
9348[label="(++) range40 GT (not (compare1 LT GT True == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];9348 -> 10179[label="",style="solid", color="black", weight=3];
9349[label="(++) range40 GT (not (compare1 LT GT True == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];9349 -> 10180[label="",style="solid", color="black", weight=3];
9350[label="(++) range40 EQ (not (GT == LT)) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];9350 -> 10181[label="",style="solid", color="black", weight=3];
9351[label="EQ : [] ++ foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="green",shape="box"];9351 -> 10182[label="",style="dashed", color="green", weight=3];
9353[label="(++) range40 EQ (not (compare1 EQ LT (EQ <= LT) == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];9353 -> 10184[label="",style="solid", color="black", weight=3];
9354[label="(++) range40 EQ (not (EQ == LT)) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];9354 -> 10185[label="",style="solid", color="black", weight=3];
9355[label="(++) range40 EQ (not (compare1 EQ GT (EQ <= GT) == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];9355 -> 10186[label="",style="solid", color="black", weight=3];
9356[label="(++) range00 True (not (GT == LT)) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];9356 -> 10187[label="",style="solid", color="black", weight=3];
9357[label="True : [] ++ foldr (++) [] (map (range0 True True) [])",fontsize=16,color="green",shape="box"];9357 -> 10188[label="",style="dashed", color="green", weight=3];
10229[label="Pos (primPlusNat zx4740 Zero)",fontsize=16,color="green",shape="box"];10229 -> 10335[label="",style="dashed", color="green", weight=3];
10230 -> 10055[label="",style="dashed", color="red", weight=0];
10230[label="primPlusInt (Pos zx4740) (index10 False)",fontsize=16,color="magenta"];10231 -> 3931[label="",style="dashed", color="red", weight=0];
10231[label="primMinusNat Zero zx4740",fontsize=16,color="magenta"];10231 -> 10336[label="",style="dashed", color="magenta", weight=3];
10231 -> 10337[label="",style="dashed", color="magenta", weight=3];
10232 -> 10058[label="",style="dashed", color="red", weight=0];
10232[label="primPlusInt (Neg zx4740) (index10 False)",fontsize=16,color="magenta"];10331[label="primPlusInt (Pos zx4550) (index10 (compare0 EQ LT True == GT))",fontsize=16,color="black",shape="box"];10331 -> 10463[label="",style="solid", color="black", weight=3];
10332[label="zx4550",fontsize=16,color="green",shape="box"];10333[label="primPlusInt (Neg zx4550) (index10 (compare0 EQ LT True == GT))",fontsize=16,color="black",shape="box"];10333 -> 10464[label="",style="solid", color="black", weight=3];
10334[label="zx4550",fontsize=16,color="green",shape="box"];10459[label="primPlusInt (Pos zx4560) (index10 (compare0 GT LT True == GT))",fontsize=16,color="black",shape="box"];10459 -> 10494[label="",style="solid", color="black", weight=3];
10460[label="primPlusInt (Pos zx4560) (index10 (compare0 GT EQ True == GT))",fontsize=16,color="black",shape="box"];10460 -> 10495[label="",style="solid", color="black", weight=3];
10461[label="primPlusInt (Neg zx4560) (index10 (compare0 GT LT True == GT))",fontsize=16,color="black",shape="box"];10461 -> 10496[label="",style="solid", color="black", weight=3];
10462[label="primPlusInt (Neg zx4560) (index10 (compare0 GT EQ True == GT))",fontsize=16,color="black",shape="box"];10462 -> 10497[label="",style="solid", color="black", weight=3];
10490[label="zx4590",fontsize=16,color="green",shape="box"];10491 -> 10323[label="",style="dashed", color="red", weight=0];
10491[label="primPlusInt (Pos zx4590) (index00 False)",fontsize=16,color="magenta"];10492[label="zx4590",fontsize=16,color="green",shape="box"];10493 -> 10325[label="",style="dashed", color="red", weight=0];
10493[label="primPlusInt (Neg zx4590) (index00 False)",fontsize=16,color="magenta"];10517[label="primPlusInt (Pos zx4600) (index00 (compare0 True False True == GT))",fontsize=16,color="black",shape="box"];10517 -> 10554[label="",style="solid", color="black", weight=3];
10518[label="primPlusInt (Neg zx4600) (index00 (compare0 True False True == GT))",fontsize=16,color="black",shape="box"];10518 -> 10555[label="",style="solid", color="black", weight=3];
10173[label="rangeSize1 EQ LT (null [])",fontsize=16,color="black",shape="box"];10173 -> 10233[label="",style="solid", color="black", weight=3];
10174[label="rangeSize1 GT LT (null [])",fontsize=16,color="black",shape="box"];10174 -> 10234[label="",style="solid", color="black", weight=3];
10569[label="(++) range40 GT (compare EQ GT /= LT && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10569 -> 10590[label="",style="solid", color="black", weight=3];
10176 -> 1381[label="",style="dashed", color="red", weight=0];
10176[label="index (EQ,GT) GT + Pos (Succ Zero)",fontsize=16,color="magenta"];10176 -> 10236[label="",style="dashed", color="magenta", weight=3];
10177[label="rangeSize1 GT GT (null ((++) range4 GT GT GT foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10177 -> 10237[label="",style="solid", color="black", weight=3];
10178[label="(++) range40 GT (not (LT == LT) && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];10178 -> 10238[label="",style="solid", color="black", weight=3];
10179[label="(++) range40 GT (not (LT == LT) && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];10179 -> 10239[label="",style="solid", color="black", weight=3];
10180[label="(++) range40 GT (not (LT == LT) && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];10180 -> 10240[label="",style="solid", color="black", weight=3];
10181[label="(++) range40 EQ (not False) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];10181 -> 10241[label="",style="solid", color="black", weight=3];
10182[label="[] ++ foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];10182 -> 10242[label="",style="solid", color="black", weight=3];
10184[label="(++) range40 EQ (not (compare1 EQ LT False == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10184 -> 10244[label="",style="solid", color="black", weight=3];
10185[label="(++) range40 EQ (not False) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];10185 -> 10245[label="",style="solid", color="black", weight=3];
10186[label="(++) range40 EQ (not (compare1 EQ GT True == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];10186 -> 10246[label="",style="solid", color="black", weight=3];
10187[label="(++) range00 True (not False) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];10187 -> 10247[label="",style="solid", color="black", weight=3];
10188[label="[] ++ foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];10188 -> 10248[label="",style="solid", color="black", weight=3];
10335 -> 4010[label="",style="dashed", color="red", weight=0];
10335[label="primPlusNat zx4740 Zero",fontsize=16,color="magenta"];10335 -> 10465[label="",style="dashed", color="magenta", weight=3];
10335 -> 10466[label="",style="dashed", color="magenta", weight=3];
10336[label="zx4740",fontsize=16,color="green",shape="box"];10337[label="Zero",fontsize=16,color="green",shape="box"];10463[label="primPlusInt (Pos zx4550) (index10 (GT == GT))",fontsize=16,color="black",shape="triangle"];10463 -> 10498[label="",style="solid", color="black", weight=3];
10464[label="primPlusInt (Neg zx4550) (index10 (GT == GT))",fontsize=16,color="black",shape="triangle"];10464 -> 10499[label="",style="solid", color="black", weight=3];
10494 -> 10463[label="",style="dashed", color="red", weight=0];
10494[label="primPlusInt (Pos zx4560) (index10 (GT == GT))",fontsize=16,color="magenta"];10494 -> 10556[label="",style="dashed", color="magenta", weight=3];
10495 -> 10463[label="",style="dashed", color="red", weight=0];
10495[label="primPlusInt (Pos zx4560) (index10 (GT == GT))",fontsize=16,color="magenta"];10495 -> 10557[label="",style="dashed", color="magenta", weight=3];
10496 -> 10464[label="",style="dashed", color="red", weight=0];
10496[label="primPlusInt (Neg zx4560) (index10 (GT == GT))",fontsize=16,color="magenta"];10496 -> 10558[label="",style="dashed", color="magenta", weight=3];
10497 -> 10464[label="",style="dashed", color="red", weight=0];
10497[label="primPlusInt (Neg zx4560) (index10 (GT == GT))",fontsize=16,color="magenta"];10497 -> 10559[label="",style="dashed", color="magenta", weight=3];
10554[label="primPlusInt (Pos zx4600) (index00 (GT == GT))",fontsize=16,color="black",shape="box"];10554 -> 10579[label="",style="solid", color="black", weight=3];
10555[label="primPlusInt (Neg zx4600) (index00 (GT == GT))",fontsize=16,color="black",shape="box"];10555 -> 10580[label="",style="solid", color="black", weight=3];
10233[label="rangeSize1 EQ LT True",fontsize=16,color="black",shape="box"];10233 -> 10338[label="",style="solid", color="black", weight=3];
10234[label="rangeSize1 GT LT True",fontsize=16,color="black",shape="box"];10234 -> 10339[label="",style="solid", color="black", weight=3];
10590[label="(++) range40 GT (not (compare EQ GT == LT) && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10590 -> 10606[label="",style="solid", color="black", weight=3];
10236 -> 1667[label="",style="dashed", color="red", weight=0];
10236[label="index (EQ,GT) GT",fontsize=16,color="magenta"];10236 -> 10341[label="",style="dashed", color="magenta", weight=3];
10236 -> 10342[label="",style="dashed", color="magenta", weight=3];
10237[label="rangeSize1 GT GT (null ((++) range40 GT (GT >= GT && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10237 -> 10343[label="",style="solid", color="black", weight=3];
10238[label="(++) range40 GT (not True && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];10238 -> 10344[label="",style="solid", color="black", weight=3];
10239[label="(++) range40 GT (not True && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];10239 -> 10345[label="",style="solid", color="black", weight=3];
10240[label="(++) range40 GT (not True && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];10240 -> 10346[label="",style="solid", color="black", weight=3];
10241[label="(++) range40 EQ True foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];10241 -> 10347[label="",style="solid", color="black", weight=3];
10242[label="foldr (++) [] (map (range4 EQ EQ) (GT : []))",fontsize=16,color="black",shape="box"];10242 -> 10348[label="",style="solid", color="black", weight=3];
10244[label="(++) range40 EQ (not (compare0 EQ LT otherwise == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10244 -> 10350[label="",style="solid", color="black", weight=3];
10245[label="(++) range40 EQ True foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];10245 -> 10351[label="",style="solid", color="black", weight=3];
10246[label="(++) range40 EQ (not (LT == LT)) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];10246 -> 10352[label="",style="solid", color="black", weight=3];
10247[label="(++) range00 True True foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];10247 -> 10353[label="",style="solid", color="black", weight=3];
10248[label="foldr (++) [] (map (range0 True True) [])",fontsize=16,color="black",shape="box"];10248 -> 10354[label="",style="solid", color="black", weight=3];
10465[label="Zero",fontsize=16,color="green",shape="box"];10466[label="zx4740",fontsize=16,color="green",shape="box"];10498[label="primPlusInt (Pos zx4550) (index10 True)",fontsize=16,color="black",shape="box"];10498 -> 10560[label="",style="solid", color="black", weight=3];
10499[label="primPlusInt (Neg zx4550) (index10 True)",fontsize=16,color="black",shape="box"];10499 -> 10561[label="",style="solid", color="black", weight=3];
10556[label="zx4560",fontsize=16,color="green",shape="box"];10557[label="zx4560",fontsize=16,color="green",shape="box"];10558[label="zx4560",fontsize=16,color="green",shape="box"];10559[label="zx4560",fontsize=16,color="green",shape="box"];10579[label="primPlusInt (Pos zx4600) (index00 True)",fontsize=16,color="black",shape="box"];10579 -> 10599[label="",style="solid", color="black", weight=3];
10580[label="primPlusInt (Neg zx4600) (index00 True)",fontsize=16,color="black",shape="box"];10580 -> 10600[label="",style="solid", color="black", weight=3];
10338[label="Pos Zero",fontsize=16,color="green",shape="box"];10339[label="Pos Zero",fontsize=16,color="green",shape="box"];10606[label="(++) range40 GT (not (compare3 EQ GT == LT) && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10606 -> 10617[label="",style="solid", color="black", weight=3];
10341[label="EQ",fontsize=16,color="green",shape="box"];10342[label="GT",fontsize=16,color="green",shape="box"];10343[label="rangeSize1 GT GT (null ((++) range40 GT (compare GT GT /= LT && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10343 -> 10468[label="",style="solid", color="black", weight=3];
10344[label="(++) range40 GT (False && GT >= LT) foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];10344 -> 10469[label="",style="solid", color="black", weight=3];
10345[label="(++) range40 GT (False && GT >= EQ) foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];10345 -> 10470[label="",style="solid", color="black", weight=3];
10346[label="(++) range40 GT (False && GT >= GT) foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];10346 -> 10471[label="",style="solid", color="black", weight=3];
10347[label="(++) (EQ : []) foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];10347 -> 10472[label="",style="solid", color="black", weight=3];
10348[label="foldr (++) [] (range4 EQ EQ GT : map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10348 -> 10473[label="",style="solid", color="black", weight=3];
10350[label="(++) range40 EQ (not (compare0 EQ LT True == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10350 -> 10475[label="",style="solid", color="black", weight=3];
10351[label="(++) (EQ : []) foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];10351 -> 10476[label="",style="solid", color="black", weight=3];
10352[label="(++) range40 EQ (not True) foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];10352 -> 10477[label="",style="solid", color="black", weight=3];
10353[label="(++) (True : []) foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];10353 -> 10478[label="",style="solid", color="black", weight=3];
10354 -> 7995[label="",style="dashed", color="red", weight=0];
10354[label="foldr (++) [] []",fontsize=16,color="magenta"];10560 -> 1395[label="",style="dashed", color="red", weight=0];
10560[label="primPlusInt (Pos zx4550) (Pos (Succ Zero))",fontsize=16,color="magenta"];10560 -> 10581[label="",style="dashed", color="magenta", weight=3];
10561 -> 1395[label="",style="dashed", color="red", weight=0];
10561[label="primPlusInt (Neg zx4550) (Pos (Succ Zero))",fontsize=16,color="magenta"];10561 -> 10582[label="",style="dashed", color="magenta", weight=3];
10599 -> 1395[label="",style="dashed", color="red", weight=0];
10599[label="primPlusInt (Pos zx4600) (Pos (Succ Zero))",fontsize=16,color="magenta"];10599 -> 10611[label="",style="dashed", color="magenta", weight=3];
10600 -> 1395[label="",style="dashed", color="red", weight=0];
10600[label="primPlusInt (Neg zx4600) (Pos (Succ Zero))",fontsize=16,color="magenta"];10600 -> 10612[label="",style="dashed", color="magenta", weight=3];
10617[label="(++) range40 GT (not (compare2 EQ GT (EQ == GT) == LT) && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10617 -> 10626[label="",style="solid", color="black", weight=3];
10468[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare GT GT == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10468 -> 10501[label="",style="solid", color="black", weight=3];
10469[label="(++) range40 GT False foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];10469 -> 10502[label="",style="solid", color="black", weight=3];
10470[label="(++) range40 GT False foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];10470 -> 10503[label="",style="solid", color="black", weight=3];
10471[label="(++) range40 GT False foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];10471 -> 10504[label="",style="solid", color="black", weight=3];
10472[label="EQ : [] ++ foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="green",shape="box"];10472 -> 10505[label="",style="dashed", color="green", weight=3];
10473[label="(++) range4 EQ EQ GT foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10473 -> 10506[label="",style="solid", color="black", weight=3];
10475[label="(++) range40 EQ (not (GT == LT)) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10475 -> 10508[label="",style="solid", color="black", weight=3];
10476[label="EQ : [] ++ foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="green",shape="box"];10476 -> 10509[label="",style="dashed", color="green", weight=3];
10477[label="(++) range40 EQ False foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];10477 -> 10510[label="",style="solid", color="black", weight=3];
10478[label="True : [] ++ foldr (++) [] (map (range0 True False) [])",fontsize=16,color="green",shape="box"];10478 -> 10511[label="",style="dashed", color="green", weight=3];
10581[label="Pos zx4550",fontsize=16,color="green",shape="box"];10582[label="Neg zx4550",fontsize=16,color="green",shape="box"];10611[label="Pos zx4600",fontsize=16,color="green",shape="box"];10612[label="Neg zx4600",fontsize=16,color="green",shape="box"];10626[label="(++) range40 GT (not (compare2 EQ GT False == LT) && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10626 -> 10635[label="",style="solid", color="black", weight=3];
10501[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare3 GT GT == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10501 -> 10563[label="",style="solid", color="black", weight=3];
10502[label="(++) [] foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];10502 -> 10564[label="",style="solid", color="black", weight=3];
10503[label="(++) [] foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];10503 -> 10565[label="",style="solid", color="black", weight=3];
10504[label="(++) [] foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];10504 -> 10566[label="",style="solid", color="black", weight=3];
10505[label="[] ++ foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];10505 -> 10567[label="",style="solid", color="black", weight=3];
10506[label="(++) range40 GT (EQ >= GT && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10506 -> 10568[label="",style="solid", color="black", weight=3];
10508[label="(++) range40 EQ (not False) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10508 -> 10570[label="",style="solid", color="black", weight=3];
10509[label="[] ++ foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];10509 -> 10571[label="",style="solid", color="black", weight=3];
10510[label="(++) [] foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];10510 -> 10572[label="",style="solid", color="black", weight=3];
10511[label="[] ++ foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];10511 -> 10573[label="",style="solid", color="black", weight=3];
10635[label="(++) range40 GT (not (compare1 EQ GT (EQ <= GT) == LT) && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10635 -> 10644[label="",style="solid", color="black", weight=3];
10563[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare2 GT GT (GT == GT) == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10563 -> 10584[label="",style="solid", color="black", weight=3];
10564[label="foldr (++) [] (map (range4 LT LT) [])",fontsize=16,color="black",shape="box"];10564 -> 10585[label="",style="solid", color="black", weight=3];
10565[label="foldr (++) [] (map (range4 LT EQ) [])",fontsize=16,color="black",shape="box"];10565 -> 10586[label="",style="solid", color="black", weight=3];
10566[label="foldr (++) [] (map (range4 LT GT) [])",fontsize=16,color="black",shape="box"];10566 -> 10587[label="",style="solid", color="black", weight=3];
10567[label="foldr (++) [] (map (range4 EQ LT) (GT : []))",fontsize=16,color="black",shape="box"];10567 -> 10588[label="",style="solid", color="black", weight=3];
10568[label="(++) range40 GT (compare EQ GT /= LT && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10568 -> 10589[label="",style="solid", color="black", weight=3];
10570[label="(++) range40 EQ True foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10570 -> 10591[label="",style="solid", color="black", weight=3];
10571[label="foldr (++) [] (map (range4 GT EQ) (GT : []))",fontsize=16,color="black",shape="box"];10571 -> 10592[label="",style="solid", color="black", weight=3];
10572[label="foldr (++) [] (map (range4 GT GT) (GT : []))",fontsize=16,color="black",shape="box"];10572 -> 10593[label="",style="solid", color="black", weight=3];
10573[label="foldr (++) [] (map (range0 True False) [])",fontsize=16,color="black",shape="box"];10573 -> 10594[label="",style="solid", color="black", weight=3];
10644[label="(++) range40 GT (not (compare1 EQ GT True == LT) && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10644 -> 10705[label="",style="solid", color="black", weight=3];
10584[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare2 GT GT True == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10584 -> 10602[label="",style="solid", color="black", weight=3];
10585[label="foldr (++) [] []",fontsize=16,color="black",shape="triangle"];10585 -> 10603[label="",style="solid", color="black", weight=3];
10586 -> 10585[label="",style="dashed", color="red", weight=0];
10586[label="foldr (++) [] []",fontsize=16,color="magenta"];10587 -> 10585[label="",style="dashed", color="red", weight=0];
10587[label="foldr (++) [] []",fontsize=16,color="magenta"];10588[label="foldr (++) [] (range4 EQ LT GT : map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10588 -> 10604[label="",style="solid", color="black", weight=3];
10589[label="(++) range40 GT (not (compare EQ GT == LT) && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10589 -> 10605[label="",style="solid", color="black", weight=3];
10591[label="(++) (EQ : []) foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10591 -> 10607[label="",style="solid", color="black", weight=3];
10592[label="foldr (++) [] (range4 GT EQ GT : map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10592 -> 10608[label="",style="solid", color="black", weight=3];
10593[label="foldr (++) [] (range4 GT GT GT : map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10593 -> 10609[label="",style="solid", color="black", weight=3];
10594 -> 7995[label="",style="dashed", color="red", weight=0];
10594[label="foldr (++) [] []",fontsize=16,color="magenta"];10705[label="(++) range40 GT (not (LT == LT) && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10705 -> 10714[label="",style="solid", color="black", weight=3];
10602[label="rangeSize1 GT GT (null ((++) range40 GT (not (EQ == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10602 -> 10614[label="",style="solid", color="black", weight=3];
10603[label="[]",fontsize=16,color="green",shape="box"];10604[label="(++) range4 EQ LT GT foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10604 -> 10615[label="",style="solid", color="black", weight=3];
10605[label="(++) range40 GT (not (compare3 EQ GT == LT) && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10605 -> 10616[label="",style="solid", color="black", weight=3];
10607[label="EQ : [] ++ foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="green",shape="box"];10607 -> 10618[label="",style="dashed", color="green", weight=3];
10608[label="(++) range4 GT EQ GT foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10608 -> 10619[label="",style="solid", color="black", weight=3];
10609[label="(++) range4 GT GT GT foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10609 -> 10620[label="",style="solid", color="black", weight=3];
10714[label="(++) range40 GT (not True && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10714 -> 10723[label="",style="solid", color="black", weight=3];
10614[label="rangeSize1 GT GT (null ((++) range40 GT (not False && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10614 -> 10623[label="",style="solid", color="black", weight=3];
10615[label="(++) range40 GT (EQ >= GT && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10615 -> 10624[label="",style="solid", color="black", weight=3];
10616[label="(++) range40 GT (not (compare2 EQ GT (EQ == GT) == LT) && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10616 -> 10625[label="",style="solid", color="black", weight=3];
10618[label="[] ++ foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10618 -> 10627[label="",style="solid", color="black", weight=3];
10619[label="(++) range40 GT (GT >= GT && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10619 -> 10628[label="",style="solid", color="black", weight=3];
10620[label="(++) range40 GT (GT >= GT && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10620 -> 10629[label="",style="solid", color="black", weight=3];
10723[label="(++) range40 GT (False && GT >= GT) foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10723 -> 10731[label="",style="solid", color="black", weight=3];
10623[label="rangeSize1 GT GT (null ((++) range40 GT (True && GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10623 -> 10632[label="",style="solid", color="black", weight=3];
10624[label="(++) range40 GT (compare EQ GT /= LT && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10624 -> 10633[label="",style="solid", color="black", weight=3];
10625[label="(++) range40 GT (not (compare2 EQ GT False == LT) && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10625 -> 10634[label="",style="solid", color="black", weight=3];
10627[label="foldr (++) [] (map (range4 GT LT) (GT : []))",fontsize=16,color="black",shape="box"];10627 -> 10636[label="",style="solid", color="black", weight=3];
10628[label="(++) range40 GT (compare GT GT /= LT && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10628 -> 10637[label="",style="solid", color="black", weight=3];
10629[label="(++) range40 GT (compare GT GT /= LT && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10629 -> 10638[label="",style="solid", color="black", weight=3];
10731[label="(++) range40 GT False foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10731 -> 10739[label="",style="solid", color="black", weight=3];
10632[label="rangeSize1 GT GT (null ((++) range40 GT (GT >= GT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10632 -> 10641[label="",style="solid", color="black", weight=3];
10633[label="(++) range40 GT (not (compare EQ GT == LT) && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10633 -> 10642[label="",style="solid", color="black", weight=3];
10634[label="(++) range40 GT (not (compare1 EQ GT (EQ <= GT) == LT) && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10634 -> 10643[label="",style="solid", color="black", weight=3];
10636[label="foldr (++) [] (range4 GT LT GT : map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10636 -> 10645[label="",style="solid", color="black", weight=3];
10637[label="(++) range40 GT (not (compare GT GT == LT) && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10637 -> 10646[label="",style="solid", color="black", weight=3];
10638[label="(++) range40 GT (not (compare GT GT == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10638 -> 10647[label="",style="solid", color="black", weight=3];
10739[label="(++) [] foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10739 -> 10747[label="",style="solid", color="black", weight=3];
10641[label="rangeSize1 GT GT (null ((++) range40 GT (compare GT GT /= LT) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10641 -> 10702[label="",style="solid", color="black", weight=3];
10642[label="(++) range40 GT (not (compare3 EQ GT == LT) && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10642 -> 10703[label="",style="solid", color="black", weight=3];
10643[label="(++) range40 GT (not (compare1 EQ GT True == LT) && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10643 -> 10704[label="",style="solid", color="black", weight=3];
10645[label="(++) range4 GT LT GT foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10645 -> 10706[label="",style="solid", color="black", weight=3];
10646[label="(++) range40 GT (not (compare3 GT GT == LT) && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10646 -> 10707[label="",style="solid", color="black", weight=3];
10647[label="(++) range40 GT (not (compare3 GT GT == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10647 -> 10708[label="",style="solid", color="black", weight=3];
10747[label="foldr (++) [] (map (range4 EQ GT) [])",fontsize=16,color="black",shape="box"];10747 -> 10756[label="",style="solid", color="black", weight=3];
10702[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare GT GT == LT)) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10702 -> 10711[label="",style="solid", color="black", weight=3];
10703[label="(++) range40 GT (not (compare2 EQ GT (EQ == GT) == LT) && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10703 -> 10712[label="",style="solid", color="black", weight=3];
10704[label="(++) range40 GT (not (LT == LT) && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10704 -> 10713[label="",style="solid", color="black", weight=3];
10706[label="(++) range40 GT (GT >= GT && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10706 -> 10715[label="",style="solid", color="black", weight=3];
10707[label="(++) range40 GT (not (compare2 GT GT (GT == GT) == LT) && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10707 -> 10716[label="",style="solid", color="black", weight=3];
10708[label="(++) range40 GT (not (compare2 GT GT (GT == GT) == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10708 -> 10717[label="",style="solid", color="black", weight=3];
10756 -> 10585[label="",style="dashed", color="red", weight=0];
10756[label="foldr (++) [] []",fontsize=16,color="magenta"];10711[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare3 GT GT == LT)) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10711 -> 10720[label="",style="solid", color="black", weight=3];
10712[label="(++) range40 GT (not (compare2 EQ GT False == LT) && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10712 -> 10721[label="",style="solid", color="black", weight=3];
10713[label="(++) range40 GT (not True && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10713 -> 10722[label="",style="solid", color="black", weight=3];
10715[label="(++) range40 GT (compare GT GT /= LT && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10715 -> 10724[label="",style="solid", color="black", weight=3];
10716[label="(++) range40 GT (not (compare2 GT GT True == LT) && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10716 -> 10725[label="",style="solid", color="black", weight=3];
10717[label="(++) range40 GT (not (compare2 GT GT True == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10717 -> 10726[label="",style="solid", color="black", weight=3];
10720[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare2 GT GT (GT == GT) == LT)) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10720 -> 10728[label="",style="solid", color="black", weight=3];
10721[label="(++) range40 GT (not (compare1 EQ GT (EQ <= GT) == LT) && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10721 -> 10729[label="",style="solid", color="black", weight=3];
10722[label="(++) range40 GT (False && GT >= EQ) foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10722 -> 10730[label="",style="solid", color="black", weight=3];
10724[label="(++) range40 GT (not (compare GT GT == LT) && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10724 -> 10732[label="",style="solid", color="black", weight=3];
10725[label="(++) range40 GT (not (EQ == LT) && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10725 -> 10733[label="",style="solid", color="black", weight=3];
10726[label="(++) range40 GT (not (EQ == LT) && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10726 -> 10734[label="",style="solid", color="black", weight=3];
10728[label="rangeSize1 GT GT (null ((++) range40 GT (not (compare2 GT GT True == LT)) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10728 -> 10736[label="",style="solid", color="black", weight=3];
10729[label="(++) range40 GT (not (compare1 EQ GT True == LT) && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10729 -> 10737[label="",style="solid", color="black", weight=3];
10730[label="(++) range40 GT False foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10730 -> 10738[label="",style="solid", color="black", weight=3];
10732[label="(++) range40 GT (not (compare3 GT GT == LT) && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10732 -> 10740[label="",style="solid", color="black", weight=3];
10733[label="(++) range40 GT (not False && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10733 -> 10741[label="",style="solid", color="black", weight=3];
10734[label="(++) range40 GT (not False && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10734 -> 10742[label="",style="solid", color="black", weight=3];
10736[label="rangeSize1 GT GT (null ((++) range40 GT (not (EQ == LT)) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10736 -> 10744[label="",style="solid", color="black", weight=3];
10737[label="(++) range40 GT (not (LT == LT) && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10737 -> 10745[label="",style="solid", color="black", weight=3];
10738[label="(++) [] foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10738 -> 10746[label="",style="solid", color="black", weight=3];
10740[label="(++) range40 GT (not (compare2 GT GT (GT == GT) == LT) && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10740 -> 10748[label="",style="solid", color="black", weight=3];
10741[label="(++) range40 GT (True && GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10741 -> 10749[label="",style="solid", color="black", weight=3];
10742[label="(++) range40 GT (True && GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10742 -> 10750[label="",style="solid", color="black", weight=3];
10744[label="rangeSize1 GT GT (null ((++) range40 GT (not False) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10744 -> 10753[label="",style="solid", color="black", weight=3];
10745[label="(++) range40 GT (not True && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10745 -> 10754[label="",style="solid", color="black", weight=3];
10746[label="foldr (++) [] (map (range4 EQ EQ) [])",fontsize=16,color="black",shape="box"];10746 -> 10755[label="",style="solid", color="black", weight=3];
10748[label="(++) range40 GT (not (compare2 GT GT True == LT) && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10748 -> 10757[label="",style="solid", color="black", weight=3];
10749[label="(++) range40 GT (GT >= EQ) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10749 -> 10758[label="",style="solid", color="black", weight=3];
10750[label="(++) range40 GT (GT >= GT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10750 -> 10759[label="",style="solid", color="black", weight=3];
10753[label="rangeSize1 GT GT (null ((++) range40 GT True foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10753 -> 10760[label="",style="solid", color="black", weight=3];
10754[label="(++) range40 GT (False && GT >= LT) foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10754 -> 10761[label="",style="solid", color="black", weight=3];
10755 -> 10585[label="",style="dashed", color="red", weight=0];
10755[label="foldr (++) [] []",fontsize=16,color="magenta"];10757[label="(++) range40 GT (not (EQ == LT) && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10757 -> 10762[label="",style="solid", color="black", weight=3];
10758[label="(++) range40 GT (compare GT EQ /= LT) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10758 -> 10763[label="",style="solid", color="black", weight=3];
10759[label="(++) range40 GT (compare GT GT /= LT) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10759 -> 10764[label="",style="solid", color="black", weight=3];
10760[label="rangeSize1 GT GT (null ((++) (GT : []) foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10760 -> 10765[label="",style="solid", color="black", weight=3];
10761[label="(++) range40 GT False foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10761 -> 10766[label="",style="solid", color="black", weight=3];
10762[label="(++) range40 GT (not False && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10762 -> 10767[label="",style="solid", color="black", weight=3];
10763[label="(++) range40 GT (not (compare GT EQ == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10763 -> 10768[label="",style="solid", color="black", weight=3];
10764[label="(++) range40 GT (not (compare GT GT == LT)) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10764 -> 10769[label="",style="solid", color="black", weight=3];
10765[label="rangeSize1 GT GT (null (GT : [] ++ foldr (++) [] (map (range4 GT GT) [])))",fontsize=16,color="black",shape="box"];10765 -> 10770[label="",style="solid", color="black", weight=3];
10766[label="(++) [] foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10766 -> 10771[label="",style="solid", color="black", weight=3];
10767[label="(++) range40 GT (True && GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10767 -> 10772[label="",style="solid", color="black", weight=3];
10768[label="(++) range40 GT (not (compare3 GT EQ == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10768 -> 10773[label="",style="solid", color="black", weight=3];
10769[label="(++) range40 GT (not (compare3 GT GT == LT)) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10769 -> 10774[label="",style="solid", color="black", weight=3];
10770[label="rangeSize1 GT GT False",fontsize=16,color="black",shape="box"];10770 -> 10775[label="",style="solid", color="black", weight=3];
10771[label="foldr (++) [] (map (range4 EQ LT) [])",fontsize=16,color="black",shape="box"];10771 -> 10776[label="",style="solid", color="black", weight=3];
10772[label="(++) range40 GT (GT >= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10772 -> 10777[label="",style="solid", color="black", weight=3];
10773[label="(++) range40 GT (not (compare2 GT EQ (GT == EQ) == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10773 -> 10778[label="",style="solid", color="black", weight=3];
10774[label="(++) range40 GT (not (compare2 GT GT (GT == GT) == LT)) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10774 -> 10779[label="",style="solid", color="black", weight=3];
10775[label="rangeSize0 GT GT otherwise",fontsize=16,color="black",shape="box"];10775 -> 10780[label="",style="solid", color="black", weight=3];
10776 -> 10585[label="",style="dashed", color="red", weight=0];
10776[label="foldr (++) [] []",fontsize=16,color="magenta"];10777[label="(++) range40 GT (compare GT LT /= LT) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10777 -> 10781[label="",style="solid", color="black", weight=3];
10778[label="(++) range40 GT (not (compare2 GT EQ False == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10778 -> 10782[label="",style="solid", color="black", weight=3];
10779[label="(++) range40 GT (not (compare2 GT GT True == LT)) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10779 -> 10783[label="",style="solid", color="black", weight=3];
10780[label="rangeSize0 GT GT True",fontsize=16,color="black",shape="box"];10780 -> 10784[label="",style="solid", color="black", weight=3];
10781[label="(++) range40 GT (not (compare GT LT == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10781 -> 10785[label="",style="solid", color="black", weight=3];
10782[label="(++) range40 GT (not (compare1 GT EQ (GT <= EQ) == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10782 -> 10786[label="",style="solid", color="black", weight=3];
10783[label="(++) range40 GT (not (EQ == LT)) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10783 -> 10787[label="",style="solid", color="black", weight=3];
10784 -> 1381[label="",style="dashed", color="red", weight=0];
10784[label="index (GT,GT) GT + Pos (Succ Zero)",fontsize=16,color="magenta"];10784 -> 10788[label="",style="dashed", color="magenta", weight=3];
10785[label="(++) range40 GT (not (compare3 GT LT == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10785 -> 10789[label="",style="solid", color="black", weight=3];
10786[label="(++) range40 GT (not (compare1 GT EQ False == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10786 -> 10790[label="",style="solid", color="black", weight=3];
10787[label="(++) range40 GT (not False) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10787 -> 10791[label="",style="solid", color="black", weight=3];
10788 -> 1667[label="",style="dashed", color="red", weight=0];
10788[label="index (GT,GT) GT",fontsize=16,color="magenta"];10788 -> 10792[label="",style="dashed", color="magenta", weight=3];
10788 -> 10793[label="",style="dashed", color="magenta", weight=3];
10789[label="(++) range40 GT (not (compare2 GT LT (GT == LT) == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10789 -> 10794[label="",style="solid", color="black", weight=3];
10790[label="(++) range40 GT (not (compare0 GT EQ otherwise == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10790 -> 10795[label="",style="solid", color="black", weight=3];
10791[label="(++) range40 GT True foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10791 -> 10796[label="",style="solid", color="black", weight=3];
10792[label="GT",fontsize=16,color="green",shape="box"];10793[label="GT",fontsize=16,color="green",shape="box"];10794[label="(++) range40 GT (not (compare2 GT LT False == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10794 -> 10797[label="",style="solid", color="black", weight=3];
10795[label="(++) range40 GT (not (compare0 GT EQ True == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10795 -> 10798[label="",style="solid", color="black", weight=3];
10796[label="(++) (GT : []) foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10796 -> 10799[label="",style="solid", color="black", weight=3];
10797[label="(++) range40 GT (not (compare1 GT LT (GT <= LT) == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10797 -> 10800[label="",style="solid", color="black", weight=3];
10798[label="(++) range40 GT (not (GT == LT)) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10798 -> 10801[label="",style="solid", color="black", weight=3];
10799[label="GT : [] ++ foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="green",shape="box"];10799 -> 10802[label="",style="dashed", color="green", weight=3];
10800[label="(++) range40 GT (not (compare1 GT LT False == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10800 -> 10803[label="",style="solid", color="black", weight=3];
10801[label="(++) range40 GT (not False) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10801 -> 10804[label="",style="solid", color="black", weight=3];
10802[label="[] ++ foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10802 -> 10805[label="",style="solid", color="black", weight=3];
10803[label="(++) range40 GT (not (compare0 GT LT otherwise == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10803 -> 10806[label="",style="solid", color="black", weight=3];
10804[label="(++) range40 GT True foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10804 -> 10807[label="",style="solid", color="black", weight=3];
10805[label="foldr (++) [] (map (range4 GT GT) [])",fontsize=16,color="black",shape="box"];10805 -> 10808[label="",style="solid", color="black", weight=3];
10806[label="(++) range40 GT (not (compare0 GT LT True == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10806 -> 10809[label="",style="solid", color="black", weight=3];
10807[label="(++) (GT : []) foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10807 -> 10810[label="",style="solid", color="black", weight=3];
10808 -> 10585[label="",style="dashed", color="red", weight=0];
10808[label="foldr (++) [] []",fontsize=16,color="magenta"];10809[label="(++) range40 GT (not (GT == LT)) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10809 -> 10811[label="",style="solid", color="black", weight=3];
10810[label="GT : [] ++ foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="green",shape="box"];10810 -> 10812[label="",style="dashed", color="green", weight=3];
10811[label="(++) range40 GT (not False) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10811 -> 10813[label="",style="solid", color="black", weight=3];
10812[label="[] ++ foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10812 -> 10814[label="",style="solid", color="black", weight=3];
10813[label="(++) range40 GT True foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10813 -> 10815[label="",style="solid", color="black", weight=3];
10814[label="foldr (++) [] (map (range4 GT EQ) [])",fontsize=16,color="black",shape="box"];10814 -> 10816[label="",style="solid", color="black", weight=3];
10815[label="(++) (GT : []) foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10815 -> 10817[label="",style="solid", color="black", weight=3];
10816 -> 10585[label="",style="dashed", color="red", weight=0];
10816[label="foldr (++) [] []",fontsize=16,color="magenta"];10817[label="GT : [] ++ foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="green",shape="box"];10817 -> 10818[label="",style="dashed", color="green", weight=3];
10818[label="[] ++ foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10818 -> 10819[label="",style="solid", color="black", weight=3];
10819[label="foldr (++) [] (map (range4 GT LT) [])",fontsize=16,color="black",shape="box"];10819 -> 10820[label="",style="solid", color="black", weight=3];
10820 -> 10585[label="",style="dashed", color="red", weight=0];
10820[label="foldr (++) [] []",fontsize=16,color="magenta"];}

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map(:(zx300, zx301)) → new_map(zx301)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_map(:(zx300, zx301)) → new_map(zx301)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_psPs(:(zx1050, zx1051), zx88, ba, bb, bc) → new_psPs(zx1051, zx88, ba, bb, bc)

From the DPs we obtained the following set of size-change graphs:

new_psPs(:(zx1050, zx1051), zx88, ba, bb, bc) → new_psPs(zx1051, zx88, ba, bb, bc)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_foldr(zx144, zx145, :(zx1460, zx1461), ba, bb, bc) → new_foldr(zx144, zx145, zx1461, ba, bb, bc)

From the DPs we obtained the following set of size-change graphs:

new_foldr(zx144, zx145, :(zx1460, zx1461), ba, bb, bc) → new_foldr(zx144, zx145, zx1461, ba, bb, bc)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 >= 4, 5 >= 5, 6 >= 6

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_psPs0(:(zx1260, zx1261), zx89, ba, bb) → new_psPs0(zx1261, zx89, ba, bb)

From the DPs we obtained the following set of size-change graphs:

new_psPs0(:(zx1260, zx1261), zx89, ba, bb) → new_psPs0(zx1261, zx89, ba, bb)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3, 4 >= 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_foldr0(zx109, :(zx1100, zx1101), ba, bb) → new_foldr0(zx109, zx1101, ba, bb)

From the DPs we obtained the following set of size-change graphs:

new_foldr0(zx109, :(zx1100, zx1101), ba, bb) → new_foldr0(zx109, zx1101, ba, bb)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3, 4 >= 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMinusNat(Succ(zx160000), Succ(zx15800)) → new_primMinusNat(zx160000, zx15800)

From the DPs we obtained the following set of size-change graphs:

new_primMinusNat(Succ(zx160000), Succ(zx15800)) → new_primMinusNat(zx160000, zx15800)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primPlusNat(Succ(zx24500), Succ(zx153000)) → new_primPlusNat(zx24500, zx153000)

From the DPs we obtained the following set of size-change graphs:

new_primPlusNat(Succ(zx24500), Succ(zx153000)) → new_primPlusNat(zx24500, zx153000)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm(zx688, zx36411) → new_enforceWHNF(zx688, zx688, zx36411)
new_enforceWHNF(zx678, zx677, :(zx36410, zx36411)) → new_dsEm(new_primPlusInt(zx677, zx36410), zx36411)

The TRS R consists of the following rules:

new_primPlusInt(Neg(zx4590), False) → new_primPlusInt4(zx4590)
new_primPlusInt4(zx4590) → new_primPlusInt0(zx4590)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt3(zx4590) → new_primPlusInt5(zx4590)
new_primPlusInt(Pos(zx4590), False) → new_primPlusInt2(zx4590)
new_primPlusInt(Neg(zx4590), True) → new_primPlusInt0(zx4590)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primMinusNat0(Succ(zx160000), Zero) → Pos(Succ(zx160000))
new_primPlusInt0(zx4590) → new_primPlusInt1(zx4590)
new_primPlusInt(Pos(zx4590), True) → new_primPlusInt3(zx4590)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusInt2(zx4590) → new_primPlusInt3(zx4590)
new_primMinusNat0(Succ(zx160000), Succ(zx15800)) → new_primMinusNat0(zx160000, zx15800)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt2(x0)
new_primPlusInt(Pos(x0), False)
new_primPlusInt4(x0)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt0(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), True)
new_primPlusInt(Neg(x0), True)
new_primPlusNat0(Zero, Zero)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Neg(x0), False)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusInt3(x0)
new_primPlusInt5(x0)
new_primMinusNat0(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm(zx688, zx36411) → new_enforceWHNF(zx688, zx688, zx36411)
new_enforceWHNF(zx678, zx677, :(zx36410, zx36411)) → new_dsEm(new_primPlusInt(zx677, zx36410), zx36411)

The TRS R consists of the following rules:

new_primPlusInt(Neg(zx4590), False) → new_primPlusInt4(zx4590)
new_primPlusInt(Pos(zx4590), False) → new_primPlusInt2(zx4590)
new_primPlusInt(Neg(zx4590), True) → new_primPlusInt0(zx4590)
new_primPlusInt(Pos(zx4590), True) → new_primPlusInt3(zx4590)
new_primPlusInt3(zx4590) → new_primPlusInt5(zx4590)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt0(zx4590) → new_primPlusInt1(zx4590)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusInt2(zx4590) → new_primPlusInt3(zx4590)
new_primPlusInt4(zx4590) → new_primPlusInt0(zx4590)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt2(x0)
new_primPlusInt(Pos(x0), False)
new_primPlusInt4(x0)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt0(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), True)
new_primPlusInt(Neg(x0), True)
new_primPlusNat0(Zero, Zero)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Neg(x0), False)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusInt3(x0)
new_primPlusInt5(x0)
new_primMinusNat0(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_enforceWHNF(zx678, zx677, :(zx36410, zx36411)) → new_dsEm(new_primPlusInt(zx677, zx36410), zx36411)
The graph contains the following edges 3 > 2
new_dsEm(zx688, zx36411) → new_enforceWHNF(zx688, zx688, zx36411)
The graph contains the following edges 1 >= 1, 1 >= 2, 2 >= 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm0(zx673, zx36011) → new_enforceWHNF0(zx673, zx673, zx36011)
new_enforceWHNF0(zx664, zx663, :(zx36010, zx36011)) → new_dsEm0(new_primPlusInt6(zx663, zx36010), zx36011)

The TRS R consists of the following rules:

new_primPlusInt6(Neg(zx4740), GT) → new_primPlusInt11(zx4740)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt8(zx4740) → new_primPlusInt7(zx4740)
new_primPlusInt6(Pos(zx4740), EQ) → new_primPlusInt10(zx4740)
new_primPlusInt6(Pos(zx4740), LT) → new_primPlusInt9(zx4740)
new_primPlusInt9(zx4740) → new_primPlusInt12(zx4740)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt6(Pos(zx4740), GT) → new_primPlusInt10(zx4740)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primMinusNat0(Succ(zx160000), Zero) → Pos(Succ(zx160000))
new_primPlusInt6(Neg(zx4740), EQ) → new_primPlusInt11(zx4740)
new_primPlusInt6(Neg(zx4740), LT) → new_primPlusInt8(zx4740)
new_primPlusInt7(zx4740) → new_primPlusInt1(zx4740)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusInt11(zx4740) → new_primPlusInt7(zx4740)
new_primPlusInt10(zx4740) → new_primPlusInt12(zx4740)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat0(Succ(zx160000), Succ(zx15800)) → new_primMinusNat0(zx160000, zx15800)
new_primPlusInt12(zx4740) → new_primPlusInt5(zx4740)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt6(Pos(x0), GT)
new_primPlusInt11(x0)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt7(x0)
new_primPlusInt6(Neg(x0), GT)
new_primPlusInt6(Neg(x0), EQ)
new_primPlusInt10(x0)
new_primPlusNat0(Zero, Zero)
new_primPlusInt6(Pos(x0), EQ)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt6(Neg(x0), LT)
new_primPlusInt12(x0)
new_primPlusInt6(Pos(x0), LT)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusInt9(x0)
new_primPlusInt5(x0)
new_primPlusInt8(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm0(zx673, zx36011) → new_enforceWHNF0(zx673, zx673, zx36011)
new_enforceWHNF0(zx664, zx663, :(zx36010, zx36011)) → new_dsEm0(new_primPlusInt6(zx663, zx36010), zx36011)

The TRS R consists of the following rules:

new_primPlusInt6(Neg(zx4740), GT) → new_primPlusInt11(zx4740)
new_primPlusInt6(Pos(zx4740), EQ) → new_primPlusInt10(zx4740)
new_primPlusInt6(Pos(zx4740), LT) → new_primPlusInt9(zx4740)
new_primPlusInt6(Pos(zx4740), GT) → new_primPlusInt10(zx4740)
new_primPlusInt6(Neg(zx4740), EQ) → new_primPlusInt11(zx4740)
new_primPlusInt6(Neg(zx4740), LT) → new_primPlusInt8(zx4740)
new_primPlusInt8(zx4740) → new_primPlusInt7(zx4740)
new_primPlusInt7(zx4740) → new_primPlusInt1(zx4740)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusInt11(zx4740) → new_primPlusInt7(zx4740)
new_primPlusInt10(zx4740) → new_primPlusInt12(zx4740)
new_primPlusInt12(zx4740) → new_primPlusInt5(zx4740)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt9(zx4740) → new_primPlusInt12(zx4740)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt6(Pos(x0), GT)
new_primPlusInt11(x0)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt7(x0)
new_primPlusInt6(Neg(x0), GT)
new_primPlusInt6(Neg(x0), EQ)
new_primPlusInt10(x0)
new_primPlusNat0(Zero, Zero)
new_primPlusInt6(Pos(x0), EQ)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt6(Neg(x0), LT)
new_primPlusInt12(x0)
new_primPlusInt6(Pos(x0), LT)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusInt9(x0)
new_primPlusInt5(x0)
new_primPlusInt8(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_enforceWHNF0(zx664, zx663, :(zx36010, zx36011)) → new_dsEm0(new_primPlusInt6(zx663, zx36010), zx36011)
The graph contains the following edges 3 > 2
new_dsEm0(zx673, zx36011) → new_enforceWHNF0(zx673, zx673, zx36011)
The graph contains the following edges 1 >= 1, 1 >= 2, 2 >= 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index12(zx544, Succ(zx5450)) → new_index12(zx544, zx5450)

From the DPs we obtained the following set of size-change graphs:

new_index12(zx544, Succ(zx5450)) → new_index12(zx544, zx5450)
The graph contains the following edges 1 >= 1, 2 > 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index120(zx704, zx705, Succ(zx7060)) → new_index120(zx704, zx705, zx7060)

From the DPs we obtained the following set of size-change graphs:

new_index120(zx704, zx705, Succ(zx7060)) → new_index120(zx704, zx705, zx7060)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index121(zx631, zx632, Succ(zx6330), Succ(zx6340)) → new_index121(zx631, zx632, zx6330, zx6340)

From the DPs we obtained the following set of size-change graphs:

new_index121(zx631, zx632, Succ(zx6330), Succ(zx6340)) → new_index121(zx631, zx632, zx6330, zx6340)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index122(zx504, zx505, Succ(zx5060)) → new_index122(zx504, zx505, zx5060)

From the DPs we obtained the following set of size-change graphs:

new_index122(zx504, zx505, Succ(zx5060)) → new_index122(zx504, zx505, zx5060)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index123(zx525, Succ(zx5260)) → new_index123(zx525, zx5260)

From the DPs we obtained the following set of size-change graphs:

new_index123(zx525, Succ(zx5260)) → new_index123(zx525, zx5260)
The graph contains the following edges 1 >= 1, 2 > 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index124(zx700, zx701, Succ(zx7020)) → new_index124(zx700, zx701, zx7020)

From the DPs we obtained the following set of size-change graphs:

new_index124(zx700, zx701, Succ(zx7020)) → new_index124(zx700, zx701, zx7020)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index125(zx626, zx627, Succ(zx6280), Succ(zx6290)) → new_index125(zx626, zx627, zx6280, zx6290)

From the DPs we obtained the following set of size-change graphs:

new_index125(zx626, zx627, Succ(zx6280), Succ(zx6290)) → new_index125(zx626, zx627, zx6280, zx6290)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index8(zx30, zx31, Succ(zx176000), Succ(zx129000)) → new_index8(zx30, zx31, zx176000, zx129000)

From the DPs we obtained the following set of size-change graphs:

new_index8(zx30, zx31, Succ(zx176000), Succ(zx129000)) → new_index8(zx30, zx31, zx176000, zx129000)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index80(zx30, zx31, Succ(zx130000), Succ(zx161000), zx129) → new_index80(zx30, zx31, zx130000, zx161000, zx129)

From the DPs we obtained the following set of size-change graphs:

new_index80(zx30, zx31, Succ(zx130000), Succ(zx161000), zx129) → new_index80(zx30, zx31, zx130000, zx161000, zx129)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index5(zx568, Succ(zx5690)) → new_index5(zx568, zx5690)

From the DPs we obtained the following set of size-change graphs:

new_index5(zx568, Succ(zx5690)) → new_index5(zx568, zx5690)
The graph contains the following edges 1 >= 1, 2 > 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index50(zx708, zx709, Succ(zx7100)) → new_index50(zx708, zx709, zx7100)

From the DPs we obtained the following set of size-change graphs:

new_index50(zx708, zx709, Succ(zx7100)) → new_index50(zx708, zx709, zx7100)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index51(zx657, zx658, Succ(zx6590), Succ(zx6600)) → new_index51(zx657, zx658, zx6590, zx6600)

From the DPs we obtained the following set of size-change graphs:

new_index51(zx657, zx658, Succ(zx6590), Succ(zx6600)) → new_index51(zx657, zx658, zx6590, zx6600)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index52(zx531, zx532, Succ(zx5330)) → new_index52(zx531, zx532, zx5330)

From the DPs we obtained the following set of size-change graphs:

new_index52(zx531, zx532, Succ(zx5330)) → new_index52(zx531, zx532, zx5330)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index53(zx556, Succ(zx5570)) → new_index53(zx556, zx5570)

From the DPs we obtained the following set of size-change graphs:

new_index53(zx556, Succ(zx5570)) → new_index53(zx556, zx5570)
The graph contains the following edges 1 >= 1, 2 > 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index54(zx692, zx693, Succ(zx6940)) → new_index54(zx692, zx693, zx6940)

From the DPs we obtained the following set of size-change graphs:

new_index54(zx692, zx693, Succ(zx6940)) → new_index54(zx692, zx693, zx6940)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_index55(zx652, zx653, Succ(zx6540), Succ(zx6550)) → new_index55(zx652, zx653, zx6540, zx6550)

From the DPs we obtained the following set of size-change graphs:

new_index55(zx652, zx653, Succ(zx6540), Succ(zx6550)) → new_index55(zx652, zx653, zx6540, zx6550)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMulNat(Succ(zx159000), zx16000) → new_primMulNat(zx159000, zx16000)

From the DPs we obtained the following set of size-change graphs:

new_primMulNat(Succ(zx159000), zx16000) → new_primMulNat(zx159000, zx16000)
The graph contains the following edges 1 > 1, 2 >= 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_ps1(zx30000), new_ps1(zx30000))
new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_ps0, new_ps0)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_ps1(zx30000), zx31000, zx30000)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_ps(zx30000), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_ps1(zx30000), new_ps1(zx30000))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_ps2, new_ps2)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 3 SCCs.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_ps0, new_ps0)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_ps1(zx30000), new_ps1(zx30000))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_ps2, new_ps2)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_ps0, new_ps0)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_ps1(zx30000), new_ps1(zx30000))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_ps2, new_ps2)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_ps0, new_ps0)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_ps1(zx30000), new_ps1(zx30000))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_ps2, new_ps2)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_ps0, new_ps0) at position [0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_primPlusInt13(Pos(Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_ps1(zx30000), new_ps1(zx30000))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_ps2, new_ps2)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_ps1(zx30000), new_ps1(zx30000)) at position [0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_ps2, new_ps2)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_ps2, new_ps2) at position [0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_primPlusInt13(Neg(Zero)), new_ps2)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(new_primPlusInt13(Pos(Zero)), new_ps0) at position [0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(new_primPlusNat1(Zero, Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000)) at position [0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_ps1(zx30000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(new_primPlusInt13(Neg(Zero)), new_ps2) at position [0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps2)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(new_primPlusNat1(Zero, Zero)), new_ps0) at position [0,0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_ps1(zx30000)) at position [1] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps1(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps2) at position [1] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero))) at position [1] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0)
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_ps0) at position [1] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero))) at position [1] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat1(Succ(x0), x1)
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero))) at position [1,0] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat1(Succ(x0), x1)
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat1(Succ(x0), x1)
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat1(Succ(x0), x1)
new_primPlusNat1(Zero, x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000)))) at position [1] we obtained the following new rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile0(Neg(Zero), Neg(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

The remaining pairs can at least be oriented weakly.

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

Used ordering: Polynomial interpretation [25]:

POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_primMinusNat1(x₁)) = 0
POL(new_takeWhile0(x₁, x₂)) = x₂
POL(new_takeWhile2(x₁, x₂)) = x₂

The following usable rules [17] were oriented:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile0(Neg(Zero), Neg(Succ(zx30000))) → new_takeWhile2(new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))

The remaining pairs can at least be oriented weakly.

new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

Used ordering: Polynomial interpretation [25]:

POL(Neg(x₁)) = 1 + x₁
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNat1(x₁)) = 1 + x₁
POL(new_takeWhile0(x₁, x₂)) = x₂
POL(new_takeWhile2(x₁, x₂)) = x₂

The following usable rules [17] were oriented:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)

R is empty.
The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172)
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile2(zx173, zx172) → new_takeWhile0(Neg(Zero), zx172) we obtained the following new rules:

new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Neg(Zero), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ UsableRulesProof

                                                                                                ↳ QDP

                                                                                                  ↳ QReductionProof

                                                                                                    ↳ QDP

                                                                                                      ↳ Rewriting

                                                                                                        ↳ QDP

                                                                                                          ↳ UsableRulesProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ UsableRulesProof

                                                                                                                    ↳ QDP

                                                                                                                      ↳ QReductionProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ UsableRulesProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ QReductionProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ QReductionProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Neg(Zero), Pos(Succ(Zero)))
new_takeWhile0(Neg(Zero), Pos(Zero)) → new_takeWhile2(Pos(Succ(Zero)), Pos(Succ(Zero)))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 2 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_ps1(zx30000), zx31000, zx30000)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_ps1(zx30000), zx31000, zx30000)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps(x0)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_ps1(zx30000), zx31000, zx30000)
new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_ps1(x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_ps1(zx30000), zx31000, zx30000) at position [2] we obtained the following new rules:

new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primPlusInt13(Neg(Succ(zx30000))), zx31000, zx30000)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primPlusInt13(Neg(Succ(zx30000))), zx31000, zx30000)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_ps1(x0)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primPlusInt13(Neg(Succ(zx30000))), zx31000, zx30000)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_ps1(x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps1(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primPlusInt13(Neg(Succ(zx30000))), zx31000, zx30000)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primPlusInt13(Neg(Succ(zx30000))), zx31000, zx30000) at position [2] we obtained the following new rules:

new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primMinusNat1(zx30000), zx31000, zx30000)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primMinusNat1(zx30000), zx31000, zx30000)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primMinusNat1(zx30000), zx31000, zx30000)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primMinusNat1(Zero)
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Narrowing

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primMinusNat1(zx30000), zx31000, zx30000)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_takeWhile0(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile11(zx31000, zx30000, new_primMinusNat1(zx30000), zx31000, zx30000) at position [] we obtained the following new rules:

new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Zero))) → new_takeWhile11(y0, Zero, Pos(Zero), y0, Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Narrowing

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Zero))) → new_takeWhile11(y0, Zero, Pos(Zero), y0, Zero)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Narrowing

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Zero))) → new_takeWhile11(y0, Zero, Pos(Zero), y0, Zero)

R is empty.
The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Narrowing

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ QDPOrderProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Zero))) → new_takeWhile11(y0, Zero, Pos(Zero), y0, Zero)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Zero))) → new_takeWhile11(y0, Zero, Pos(Zero), y0, Zero)

The remaining pairs can at least be oriented weakly.

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))

Used ordering: Polynomial interpretation [25]:

POL(Neg(x₁)) = 1
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 0
POL(Zero) = 0
POL(new_takeWhile0(x₁, x₂)) = x₂
POL(new_takeWhile11(x₁, x₂, x₃, x₄, x₅)) = x₂ + x₃
POL(new_takeWhile12(x₁, x₂, x₃)) = x₃

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Narrowing

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ QDPOrderProof

                                                                                        ↳ QDP

                                                                                          ↳ QDPOrderProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile11(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile11(zx435, zx436, zx437, Zero, Zero) → new_takeWhile12(zx435, zx436, zx437)

The remaining pairs can at least be oriented weakly.

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))

Used ordering: Polynomial interpretation [25]:

POL(Neg(x₁)) = x₁
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_takeWhile0(x₁, x₂)) = x₂
POL(new_takeWhile11(x₁, x₂, x₃, x₄, x₅)) = 1 + x₃
POL(new_takeWhile12(x₁, x₂, x₃)) = x₃

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Narrowing

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ QDPOrderProof

                                                                                        ↳ QDP

                                                                                          ↳ QDPOrderProof

                                                                                            ↳ QDP

                                                                                              ↳ DependencyGraphProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
new_takeWhile12(zx435, zx436, zx437) → new_takeWhile0(Neg(Succ(zx435)), zx437)
new_takeWhile0(Neg(Succ(y0)), Neg(Succ(Succ(x0)))) → new_takeWhile11(y0, Succ(x0), Neg(Succ(x0)), y0, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Narrowing

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ QDPOrderProof

                                                                                        ↳ QDP

                                                                                          ↳ QDPOrderProof

                                                                                            ↳ QDP

                                                                                              ↳ DependencyGraphProof

                                                                                                ↳ QDP

                                                                                                  ↳ QDPSizeChangeProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)

From the DPs we obtained the following set of size-change graphs:

new_takeWhile11(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile11(zx435, zx436, zx437, zx4380, zx4390)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_ps1(zx30000), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_ps(zx30000), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_ps1(zx30000), new_ps1(zx30000)) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_ps(zx30000), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_ps(zx30000), zx30000, zx31000) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_primPlusInt13(Pos(Succ(zx30000))), zx30000, zx31000)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_primPlusInt13(Pos(Succ(zx30000))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_primPlusInt13(Pos(Succ(zx30000))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_ps(x0)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_primPlusInt13(Pos(Succ(zx30000))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, new_primPlusInt13(Pos(Succ(zx30000))), zx30000, zx31000) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_ps2, new_ps2) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_ps0, new_ps0) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_ps2, new_ps2) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primPlusInt13(Neg(Succ(zx30000))), new_ps1(zx30000)) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_ps0, new_ps0) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(new_primPlusNat1(Succ(zx30000), Zero)), zx30000, zx31000) at position [2,0] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Neg(Zero)), new_ps2) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Pos(Zero)), new_ps0) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, new_primPlusInt13(Neg(Zero)), new_ps2) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps2)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_ps1(zx30000)) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_ps1(x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps1(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps2)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps2) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000))))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primPlusInt13(Neg(Succ(zx30000)))) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_ps0) at position [1,0] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps2) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_ps2
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_ps0) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero))) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero))) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), new_primPlusInt13(Pos(Zero)), new_ps0) at position [1] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(new_primPlusNat1(Zero, Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero))) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(new_primPlusNat1(Zero, Zero)), new_ps0)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(new_primPlusNat1(Zero, Zero)), new_ps0) at position [1,0] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps0)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero))) at position [2,0] we obtained the following new rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps0)

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_ps0) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_ps0

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps0

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero))) at position [2] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero))) at position [2,0] we obtained the following new rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat1(Succ(x0), x1)
new_primPlusNat1(Zero, x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_takeWhile0(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile1(zx31000, zx30000, Pos(Succ(Succ(new_primPlusNat0(zx30000, Zero)))), zx30000, zx31000) at position [] we obtained the following new rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Zero)
new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile0(Pos(Succ(zx31000)), Neg(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(zx3100), Neg(Succ(zx30000))) → new_takeWhile(zx3100, new_primMinusNat1(zx30000), new_primMinusNat1(zx30000))
new_takeWhile0(Pos(Zero), Neg(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

The remaining pairs can at least be oriented weakly.

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

Used ordering: Polynomial interpretation [25]:

POL(Neg(x₁)) = 1 + x₁
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNat1(x₁)) = 1 + x₁
POL(new_takeWhile(x₁, x₂, x₃)) = x₃
POL(new_takeWhile0(x₁, x₂)) = x₂
POL(new_takeWhile1(x₁, x₂, x₃, x₄, x₅)) = x₃
POL(new_takeWhile10(x₁, x₂, x₃)) = x₃

The following usable rules [17] were oriented:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

The TRS R consists of the following rules:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile(zx3100, zx166, zx165) → new_takeWhile0(Pos(zx3100), zx165) we obtained the following new rules:

new_takeWhile(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Succ(z0)), Pos(Succ(Zero)))
new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Zero), Pos(Succ(Zero)))
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Succ(z0)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile0(Pos(Zero), Pos(Zero)) → new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile(Zero, Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Zero), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Succ(z0)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile0(Pos(Succ(zx31000)), Pos(Zero)) → new_takeWhile(Succ(zx31000), Pos(Succ(Zero)), Pos(Succ(Zero)))

The remaining pairs can at least be oriented weakly.

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Succ(z0)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

Used ordering: Polynomial interpretation [25]:

POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_takeWhile(x₁, x₂, x₃)) = x₃
POL(new_takeWhile0(x₁, x₂)) = x₂
POL(new_takeWhile1(x₁, x₂, x₃, x₄, x₅)) = x₃
POL(new_takeWhile10(x₁, x₂, x₃)) = x₃

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Succ(z0)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Zero))) → new_takeWhile1(y0, Zero, Pos(Succ(Succ(Zero))), Zero, y0)

The remaining pairs can at least be oriented weakly.

new_takeWhile(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Succ(z0)), Pos(Succ(Zero)))
new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

Used ordering: Matrix interpretation [3]:
Non-tuple symbols:

M( Succ(x₁) ) =

/	0	\
\	0	/

/	0	1	\
\	0	0	/

x₁

M( Pos(x₁) ) =

/	0	\
\	0	/

/	0	0	\
\	1	0	/

x₁

M( Zero ) =

/	0	\
\	1	/

Tuple symbols:

M( new_takeWhile1(x₁, ..., x₅) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

[

]

x₅

M( new_takeWhile10(x₁, ..., x₃) ) =

[

]

x₁

[

]

x₂

[

]

x₃

M( new_takeWhile0(x₁, x₂) ) =

[

]

x₁

[

]

x₂

M( new_takeWhile(x₁, ..., x₃) ) =

[

]

x₁

[

]

x₂

[

]

x₃

Matrix type:
We used a basic matrix type which is not further parametrizeable.

As matrix orders are CE-compatible, we used usable rules w.r.t. argument filtering in the order.
The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile0(Pos(Succ(z0)), Pos(Succ(Zero)))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile(Succ(z0), z2, z2) → new_takeWhile0(Pos(Succ(z0)), z2) we obtained the following new rules:

new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1)))) → new_takeWhile0(Pos(Succ(x0)), Pos(Succ(Succ(y_1))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0)
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1)))) → new_takeWhile0(Pos(Succ(x0)), Pos(Succ(Succ(y_1))))
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile0(Pos(Succ(y0)), Pos(Succ(Succ(x0)))) → new_takeWhile1(y0, Succ(x0), Pos(Succ(Succ(Succ(x0)))), Succ(x0), y0) we obtained the following new rules:

new_takeWhile0(Pos(Succ(Succ(y_4))), Pos(Succ(Succ(x1)))) → new_takeWhile1(Succ(y_4), Succ(x1), Pos(Succ(Succ(Succ(x1)))), Succ(x1), Succ(y_4))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330)
new_takeWhile0(Pos(Succ(Succ(y_4))), Pos(Succ(Succ(x1)))) → new_takeWhile1(Succ(y_4), Succ(x1), Pos(Succ(Succ(Succ(x1)))), Succ(x1), Succ(y_4))
new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1)))) → new_takeWhile0(Pos(Succ(x0)), Pos(Succ(Succ(y_1))))
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile1(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile1(zx429, zx430, zx431, zx4320, zx4330) we obtained the following new rules:

new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Succ(y_3))) → new_takeWhile1(x0, x1, x2, Zero, Succ(y_3))
new_takeWhile1(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4))) → new_takeWhile1(x0, x1, x2, Succ(y_3), Succ(y_4))
new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Zero)) → new_takeWhile1(x0, x1, x2, Zero, Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Succ(y_3))) → new_takeWhile1(x0, x1, x2, Zero, Succ(y_3))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4))) → new_takeWhile1(x0, x1, x2, Succ(y_3), Succ(y_4))
new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1)))) → new_takeWhile0(Pos(Succ(x0)), Pos(Succ(Succ(y_1))))
new_takeWhile0(Pos(Succ(Succ(y_4))), Pos(Succ(Succ(x1)))) → new_takeWhile1(Succ(y_4), Succ(x1), Pos(Succ(Succ(Succ(x1)))), Succ(x1), Succ(y_4))
new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Zero)) → new_takeWhile1(x0, x1, x2, Zero, Zero)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)
new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile10(zx429, zx430, zx431) → new_takeWhile(Succ(zx429), zx431, zx431) we obtained the following new rules:

new_takeWhile10(x0, x1, Pos(Succ(Succ(y_1)))) → new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Succ(y_3))) → new_takeWhile1(x0, x1, x2, Zero, Succ(y_3))
new_takeWhile10(x0, x1, Pos(Succ(Succ(y_1)))) → new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1))))
new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431)
new_takeWhile1(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4))) → new_takeWhile1(x0, x1, x2, Succ(y_3), Succ(y_4))
new_takeWhile0(Pos(Succ(Succ(y_4))), Pos(Succ(Succ(x1)))) → new_takeWhile1(Succ(y_4), Succ(x1), Pos(Succ(Succ(Succ(x1)))), Succ(x1), Succ(y_4))
new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1)))) → new_takeWhile0(Pos(Succ(x0)), Pos(Succ(Succ(y_1))))
new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Zero)) → new_takeWhile1(x0, x1, x2, Zero, Zero)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile1(zx429, zx430, zx431, Zero, Zero) → new_takeWhile10(zx429, zx430, zx431) we obtained the following new rules:

new_takeWhile1(x0, x1, Pos(Succ(Succ(y_2))), Zero, Zero) → new_takeWhile10(x0, x1, Pos(Succ(Succ(y_2))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Succ(y_3))) → new_takeWhile1(x0, x1, x2, Zero, Succ(y_3))
new_takeWhile10(x0, x1, Pos(Succ(Succ(y_1)))) → new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1))))
new_takeWhile1(x0, x1, Pos(Succ(Succ(y_2))), Zero, Zero) → new_takeWhile10(x0, x1, Pos(Succ(Succ(y_2))))
new_takeWhile1(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4))) → new_takeWhile1(x0, x1, x2, Succ(y_3), Succ(y_4))
new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1)))) → new_takeWhile0(Pos(Succ(x0)), Pos(Succ(Succ(y_1))))
new_takeWhile0(Pos(Succ(Succ(y_4))), Pos(Succ(Succ(x1)))) → new_takeWhile1(Succ(y_4), Succ(x1), Pos(Succ(Succ(Succ(x1)))), Succ(x1), Succ(y_4))
new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Zero)) → new_takeWhile1(x0, x1, x2, Zero, Zero)
new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile1(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile(Succ(zx429), zx431, zx431) we obtained the following new rules:

new_takeWhile1(x0, x1, Pos(Succ(Succ(y_1))), Zero, Succ(x3)) → new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ UsableRulesProof

                                                                                                                        ↳ QDP

                                                                                                                          ↳ Rewriting

                                                                                                                            ↳ QDP

                                                                                                                              ↳ Rewriting

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ QReductionProof

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ Rewriting

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ Rewriting

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ QReductionProof

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ Rewriting

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Narrowing

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ QDPOrderProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ QReductionProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ DependencyGraphProof

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                                ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Succ(y_3))) → new_takeWhile1(x0, x1, x2, Zero, Succ(y_3))
new_takeWhile1(x0, x1, Pos(Succ(Succ(y_1))), Zero, Succ(x3)) → new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1))))
new_takeWhile10(x0, x1, Pos(Succ(Succ(y_1)))) → new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1))))
new_takeWhile1(x0, x1, Pos(Succ(Succ(y_2))), Zero, Zero) → new_takeWhile10(x0, x1, Pos(Succ(Succ(y_2))))
new_takeWhile1(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4))) → new_takeWhile1(x0, x1, x2, Succ(y_3), Succ(y_4))
new_takeWhile0(Pos(Succ(Succ(y_4))), Pos(Succ(Succ(x1)))) → new_takeWhile1(Succ(y_4), Succ(x1), Pos(Succ(Succ(Succ(x1)))), Succ(x1), Succ(y_4))
new_takeWhile(Succ(x0), Pos(Succ(Succ(y_1))), Pos(Succ(Succ(y_1)))) → new_takeWhile0(Pos(Succ(x0)), Pos(Succ(Succ(y_1))))
new_takeWhile1(x0, x1, x2, Succ(Zero), Succ(Zero)) → new_takeWhile1(x0, x1, x2, Zero, Zero)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 3 SCCs.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))) at position [0] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000)))) at position [0] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))) at position [0] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero))) at position [0,0] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000)))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero))) at position [1,0] we obtained the following new rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ UsableRulesProof

                                                                                            ↳ QDP

                                                                                              ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat1(Zero, x0)
new_primPlusNat1(Succ(x0), x1)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ UsableRulesProof

                                                                                            ↳ QDP

                                                                                              ↳ QReductionProof

                                                                                                ↳ QDP

                                                                                                  ↳ QDPOrderProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → new_takeWhile5(new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile4(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The remaining pairs can at least be oriented weakly.

new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

Used ordering: Polynomial interpretation [25]:

POL(Integer(x₁)) = x₁
POL(Neg(x₁)) = 1 + x₁
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 1
POL(new_primMinusNat1(x₁)) = 1 + x₁
POL(new_takeWhile4(x₁, x₂)) = x₂
POL(new_takeWhile5(x₁, x₂)) = x₂

The following usable rules [17] were oriented:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ UsableRulesProof

                                                                                            ↳ QDP

                                                                                              ↳ QReductionProof

                                                                                                ↳ QDP

                                                                                                  ↳ QDPOrderProof

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ UsableRulesProof

                                                                                            ↳ QDP

                                                                                              ↳ QReductionProof

                                                                                                ↳ QDP

                                                                                                  ↳ QDPOrderProof

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

R is empty.
The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ UsableRulesProof

                                                                                            ↳ QDP

                                                                                              ↳ QReductionProof

                                                                                                ↳ QDP

                                                                                                  ↳ QDPOrderProof

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Instantiation

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile5(zx212, zx211) → new_takeWhile4(Integer(Neg(Zero)), Integer(zx211)) we obtained the following new rules:

new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Succ(Zero))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ UsableRulesProof

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ UsableRulesProof

                                                                                ↳ QDP

                                                                                  ↳ QReductionProof

                                                                                    ↳ QDP

                                                                                      ↳ Rewriting

                                                                                        ↳ QDP

                                                                                          ↳ UsableRulesProof

                                                                                            ↳ QDP

                                                                                              ↳ QReductionProof

                                                                                                ↳ QDP

                                                                                                  ↳ QDPOrderProof

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ QReductionProof

                                                                                                            ↳ QDP

                                                                                                              ↳ Instantiation

                                                                                                                ↳ QDP

                                                                                                                  ↳ DependencyGraphProof

                                        ↳ QDP

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Succ(Zero))))
new_takeWhile4(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_takeWhile5(Pos(Succ(Zero)), Pos(Succ(Zero)))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 2 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488)))) at position [1] we obtained the following new rules:

new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488)))) at position [1] we obtained the following new rules:

new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488))))
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488)))) at position [2] we obtained the following new rules:

new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)
new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488))))

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primPlusInt13(Neg(Succ(zx488)))) at position [2] we obtained the following new rules:

new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ QDPOrderProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile6(zx487, zx520, zx519) → new_takeWhile4(Integer(Neg(Succ(zx487))), Integer(zx519))

The remaining pairs can at least be oriented weakly.

new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

Used ordering: Polynomial interpretation [25]:

POL(Integer(x₁)) = x₁
POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNat1(x₁)) = x₁
POL(new_takeWhile14(x₁, x₂, x₃, x₄)) = 1 + x₂
POL(new_takeWhile16(x₁, x₂)) = 1 + x₂
POL(new_takeWhile4(x₁, x₂)) = x₂
POL(new_takeWhile6(x₁, x₂, x₃)) = 1 + x₃

The following usable rules [17] were oriented:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ QDPOrderProof

                                                                            ↳ QDP

                                                                              ↳ DependencyGraphProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile16(zx487, zx488) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile6(zx487, new_primMinusNat1(zx488), new_primMinusNat1(zx488))
new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
new_takeWhile4(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile14(zx310000, zx300000, zx310000, zx300000)
new_takeWhile14(zx487, zx488, Zero, Zero) → new_takeWhile16(zx487, zx488)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 4 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ QDPOrderProof

                                                                            ↳ QDP

                                                                              ↳ DependencyGraphProof

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ QDPOrderProof

                                                                            ↳ QDP

                                                                              ↳ DependencyGraphProof

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)

R is empty.
The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ QDPOrderProof

                                                                            ↳ QDP

                                                                              ↳ DependencyGraphProof

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ QDPSizeChangeProof

                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)

From the DPs we obtained the following set of size-change graphs:

new_takeWhile14(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile14(zx487, zx488, zx4890, zx4900)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445)))) at position [1] we obtained the following new rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445)))) at position [1] we obtained the following new rules:

new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000)))) at position [1] we obtained the following new rules:

new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero))) at position [2] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero))) at position [1,0] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(new_primPlusNat1(Zero, Zero)), new_primPlusInt13(Pos(Zero))) at position [1,0] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Neg(Zero))) at position [2] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

The TRS R consists of the following rules:

new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445)))) at position [1,0] we obtained the following new rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(new_primPlusNat1(Succ(zx445), Zero)), new_primPlusInt13(Pos(Succ(zx445)))) at position [1,0] we obtained the following new rules:

new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primPlusInt13(Neg(Succ(zx300000)))) at position [2] we obtained the following new rules:

new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))

The TRS R consists of the following rules:

new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero))) at position [2] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), new_primPlusInt13(Pos(Zero))) at position [2] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445)))) at position [2] we obtained the following new rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), new_primPlusInt13(Pos(Succ(zx445)))) at position [2] we obtained the following new rules:

new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt13(Pos(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero))) at position [2,0] we obtained the following new rules:

new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero))) at position [2,0] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(new_primPlusNat1(Zero, Zero))) at position [2,0] we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero)))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(new_primPlusNat1(Succ(zx445), Zero))) at position [2,0] we obtained the following new rules:

new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Succ(x0), x1)
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat1(Zero, x0)
new_primPlusNat1(Succ(x0), x1)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile4(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))

The remaining pairs can at least be oriented weakly.

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

Used ordering: Polynomial interpretation [25]:

POL(Integer(x₁)) = x₁
POL(Neg(x₁)) = 1
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 0
POL(Zero) = 0
POL(new_primMinusNat1(x₁)) = 1
POL(new_primPlusNat0(x₁, x₂)) = 1
POL(new_takeWhile13(x₁, x₂, x₃, x₄)) = 0
POL(new_takeWhile15(x₁, x₂)) = 0
POL(new_takeWhile3(x₁, x₂, x₃)) = x₃
POL(new_takeWhile4(x₁, x₂)) = x₂

The following usable rules [17] were oriented:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile4(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → new_takeWhile3(zx31000, new_primMinusNat1(zx300000), new_primMinusNat1(zx300000))

The remaining pairs can at least be oriented weakly.

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

Used ordering: Polynomial interpretation [25]:

POL(Integer(x₁)) = x₁
POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNat1(x₁)) = x₁
POL(new_primPlusNat0(x₁, x₂)) = 0
POL(new_takeWhile13(x₁, x₂, x₃, x₄)) = 0
POL(new_takeWhile15(x₁, x₂)) = 0
POL(new_takeWhile3(x₁, x₂, x₃)) = x₃
POL(new_takeWhile4(x₁, x₂)) = x₂

The following usable rules [17] were oriented:

new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primMinusNat1(Zero) → Pos(Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primMinusNat1(Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNat1(Zero)
new_primMinusNat1(Succ(x0))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile3(zx31000, zx196, zx195) → new_takeWhile4(Integer(Pos(zx31000)), Integer(zx195)) we obtained the following new rules:

new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Succ(Zero))))
new_takeWhile3(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Zero))))
new_takeWhile3(Succ(z0), Pos(Succ(Succ(y_0))), Pos(Succ(Succ(y_1)))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(y_1)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Succ(Zero))))
new_takeWhile4(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_takeWhile3(Zero, Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile3(Succ(z0), Pos(Succ(Zero)), Pos(Succ(Zero))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → new_takeWhile3(Succ(zx310000), Pos(Succ(Zero)), Pos(Succ(Zero)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(Succ(z0), Pos(Succ(Succ(y_0))), Pos(Succ(Succ(y_1)))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(y_1)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 4 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000)
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(Succ(z0), Pos(Succ(Succ(y_0))), Pos(Succ(Succ(y_1)))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(y_1)))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile4(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile13(zx310000, zx300000, zx300000, zx310000) we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(z2))))) → new_takeWhile13(z0, Succ(z2), Succ(z2), z0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470)
new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(z2))))) → new_takeWhile13(z0, Succ(z2), Succ(z2), z0)
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(Succ(z0), Pos(Succ(Succ(y_0))), Pos(Succ(Succ(y_1)))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(y_1)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile13(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile13(zx444, zx445, zx4460, zx4470) we obtained the following new rules:

new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(z2))))) → new_takeWhile13(z0, Succ(z2), Succ(z2), z0)
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(Succ(z0), Pos(Succ(Succ(y_0))), Pos(Succ(Succ(y_1)))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(y_1)))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(z2))))) → new_takeWhile13(z0, Succ(z2), Succ(z2), z0) we obtained the following new rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile3(Succ(z0), Pos(Succ(Succ(y_0))), Pos(Succ(Succ(y_1)))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(y_1)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile3(Succ(z0), Pos(Succ(Succ(y_0))), Pos(Succ(Succ(y_1)))) → new_takeWhile4(Integer(Pos(Succ(z0))), Integer(Pos(Succ(Succ(y_1))))) we obtained the following new rules:

new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_takeWhile15(zx444, zx445) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero))))) at position [2,0,0,0] we obtained the following new rules:

new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Zero, Zero)))), Pos(Succ(Succ(Zero))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Zero, Zero)))), Pos(Succ(Succ(Zero))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0))))) at position [1,0,0,0] we obtained the following new rules:

new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Zero, Zero)))), Pos(Succ(Succ(Zero))))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Zero, Zero)))), Pos(Succ(Succ(Zero)))) at position [1,0,0,0] we obtained the following new rules:

new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_takeWhile13(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile3(Succ(zx444), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero)))), Pos(Succ(Succ(new_primPlusNat0(zx445, Zero))))) at position [2,0,0,0] we obtained the following new rules:

new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Zero, Zero)))), Pos(Succ(Succ(Zero))))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Zero, Zero)))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Zero, Zero)))), Pos(Succ(Succ(Zero)))) at position [1,0,0,0] we obtained the following new rules:

new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(new_primPlusNat0(Succ(x0), Zero)))), Pos(Succ(Succ(Succ(x0))))) at position [1,0,0,0] we obtained the following new rules:

new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

The TRS R consists of the following rules:

new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusNat0(Succ(x0), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Zero))))) we obtained the following new rules:

new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1))))))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Succ(y_1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_0))))), Integer(Pos(Succ(Succ(Succ(y_1)))))) we obtained the following new rules:

new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(x1))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) we obtained the following new rules:

new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile13(y0, Succ(x0), Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0))))) we obtained the following new rules:

new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile13(y0, Zero, Zero, Succ(y2)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) we obtained the following new rules:

new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(Succ(Zero), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(Succ(Zero), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile15(y0, Zero) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) we obtained the following new rules:

new_takeWhile15(Succ(Zero), Zero) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Succ(Zero), Zero) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(Succ(Zero), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0)))))
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile15(y0, Succ(x0)) → new_takeWhile3(Succ(y0), Pos(Succ(Succ(Succ(x0)))), Pos(Succ(Succ(Succ(x0))))) we obtained the following new rules:

new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Succ(Zero), Zero) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(Succ(Zero), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile13(zx444, zx445, Zero, Zero) → new_takeWhile15(zx444, zx445) we obtained the following new rules:

new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Succ(y_1))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Zero)
new_takeWhile13(Succ(Zero), Zero, Zero, Zero) → new_takeWhile15(Succ(Zero), Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Succ(Zero), Zero) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(Succ(Zero), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Succ(y_1))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero)
new_takeWhile13(Succ(Zero), Zero, Zero, Zero) → new_takeWhile15(Succ(Zero), Zero)
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Zero)
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile13(x0, x1, Succ(Zero), Succ(Zero)) → new_takeWhile13(x0, x1, Zero, Zero) we obtained the following new rules:

new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero)
new_takeWhile13(Succ(Succ(y_0)), Zero, Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero)
new_takeWhile13(Succ(Zero), Zero, Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Zero), Zero, Zero, Zero)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                                              ↳ DependencyGraphProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Succ(Zero), Zero) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero))
new_takeWhile13(Succ(Succ(y_0)), Zero, Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero)
new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(Succ(Zero), Zero, Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Zero), Zero, Zero, Zero)
new_takeWhile13(Succ(Zero), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile3(Succ(Succ(Zero)), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Zero)))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero)
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Succ(y_1))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Zero)
new_takeWhile13(Succ(Zero), Zero, Zero, Zero) → new_takeWhile15(Succ(Zero), Zero)
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 6 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                                              ↳ DependencyGraphProof

                                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile13(Succ(Succ(y_0)), Zero, Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero)
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero)
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Succ(y_1))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Zero)
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Zero)

The remaining pairs can at least be oriented weakly.

new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile13(Succ(Succ(y_0)), Zero, Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero)
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero)
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Succ(y_1))
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))

Used ordering: Polynomial interpretation [25]:

POL(Integer(x₁)) = 0
POL(Pos(x₁)) = 0
POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_takeWhile13(x₁, x₂, x₃, x₄)) = x₂
POL(new_takeWhile15(x₁, x₂)) = 0
POL(new_takeWhile3(x₁, x₂, x₃)) = 0
POL(new_takeWhile4(x₁, x₂)) = 0

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                                              ↳ DependencyGraphProof

                                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero)
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Succ(y_1))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile13(Succ(Succ(y_0)), Zero, Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Zero, Zero, Zero)
new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_2))))), Integer(Pos(Succ(Succ(Zero))))) → new_takeWhile13(Succ(Succ(y_2)), Succ(Zero), Succ(Zero), Succ(Succ(y_2)))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile15(Succ(Succ(y_0)), Zero) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero))))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Zero))), Pos(Succ(Succ(Zero)))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Zero)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 4 less nodes.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ Rewriting

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ Rewriting

                                                                    ↳ QDP

                                                                      ↳ Rewriting

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ Rewriting

                                                                                    ↳ QDP

                                                                                      ↳ UsableRulesProof

                                                                                        ↳ QDP

                                                                                          ↳ Rewriting

                                                                                            ↳ QDP

                                                                                              ↳ Rewriting

                                                                                                ↳ QDP

                                                                                                  ↳ Rewriting

                                                                                                    ↳ QDP

                                                                                                      ↳ UsableRulesProof

                                                                                                        ↳ QDP

                                                                                                          ↳ Rewriting

                                                                                                            ↳ QDP

                                                                                                              ↳ Rewriting

                                                                                                                ↳ QDP

                                                                                                                  ↳ Rewriting

                                                                                                                    ↳ QDP

                                                                                                                      ↳ Rewriting

                                                                                                                        ↳ QDP

                                                                                                                          ↳ UsableRulesProof

                                                                                                                            ↳ QDP

                                                                                                                              ↳ QReductionProof

                                                                                                                                ↳ QDP

                                                                                                                                  ↳ Rewriting

                                                                                                                                    ↳ QDP

                                                                                                                                      ↳ Rewriting

                                                                                                                                        ↳ QDP

                                                                                                                                          ↳ Rewriting

                                                                                                                                            ↳ QDP

                                                                                                                                              ↳ UsableRulesProof

                                                                                                                                                ↳ QDP

                                                                                                                                                  ↳ Rewriting

                                                                                                                                                    ↳ QDP

                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                        ↳ QDP

                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                            ↳ QDP

                                                                                                                                                              ↳ QDPOrderProof

                                                                                                                                                                ↳ QDP

                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                    ↳ QDP

                                                                                                                                                                      ↳ UsableRulesProof

                                                                                                                                                                        ↳ QDP

                                                                                                                                                                          ↳ QReductionProof

                                                                                                                                                                            ↳ QDP

                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                  ↳ DependencyGraphProof

                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                      ↳ Instantiation

                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                      ↳ Narrowing

                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                          ↳ Rewriting

                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                  ↳ Narrowing

                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                      ↳ Rewriting

                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                          ↳ UsableRulesProof

                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                              ↳ Rewriting

                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                  ↳ UsableRulesProof

                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                      ↳ QReductionProof

                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                          ↳ Instantiation

                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                              ↳ Instantiation

                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                  ↳ Instantiation

                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                              ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                  ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                      ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                        ↳ QDP

                                                                                                                                                                                                                                                                          ↳ ForwardInstantiation

                                                                                                                                                                                                                                                                            ↳ QDP

                                                                                                                                                                                                                                                                              ↳ DependencyGraphProof

                                                                                                                                                                                                                                                                                ↳ QDP

                                                                                                                                                                                                                                                                                  ↳ QDPOrderProof

                                                                                                                                                                                                                                                                                    ↳ QDP

                                                                                                                                                                                                                                                                                      ↳ DependencyGraphProof

                                                                                                                                                                                                                                                                                        ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Succ(Zero), Succ(Zero)) → new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero)
new_takeWhile15(Succ(Succ(y_0)), Succ(x1)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile13(Succ(Succ(y_0)), Succ(y_1), Zero, Zero) → new_takeWhile15(Succ(Succ(y_0)), Succ(y_1))
new_takeWhile13(x0, x1, Succ(Succ(y_2)), Succ(Succ(y_3))) → new_takeWhile13(x0, x1, Succ(y_2), Succ(y_3))
new_takeWhile4(Integer(Pos(Succ(Succ(Succ(y_3))))), Integer(Pos(Succ(Succ(Succ(y_2)))))) → new_takeWhile13(Succ(Succ(y_3)), Succ(Succ(y_2)), Succ(Succ(y_2)), Succ(Succ(y_3)))
new_takeWhile3(Succ(Succ(Succ(x0))), Pos(Succ(Succ(Succ(z1)))), Pos(Succ(Succ(Succ(z1))))) → new_takeWhile4(Integer(Pos(Succ(Succ(Succ(x0))))), Integer(Pos(Succ(Succ(Succ(z1))))))
new_takeWhile13(Succ(Succ(y_0)), Succ(x1), Zero, Succ(x2)) → new_takeWhile3(Succ(Succ(Succ(y_0))), Pos(Succ(Succ(Succ(x1)))), Pos(Succ(Succ(Succ(x1)))))
new_takeWhile13(x0, x1, Succ(Zero), Succ(Succ(y_2))) → new_takeWhile13(x0, x1, Zero, Succ(y_2))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_range0(@2(zx400, zx401), @2(zx410, zx411), app(app(ty_@2, ea), eb), de) → new_range0(zx400, zx410, ea, eb)
new_foldr2(zx38, zx39, @2(zx400, zx401), @2(zx410, zx411), :(zx420, zx421), da, app(app(ty_@2, app(app(ty_@2, ea), eb)), de), dc) → new_range0(zx400, zx410, ea, eb)
new_foldr2(zx38, zx39, @2(zx400, zx401), @2(zx410, zx411), :(zx420, zx421), da, app(app(ty_@2, app(app(app(ty_@3, df), dg), dh)), de), dc) → new_range(zx400, zx410, df, dg, dh)
new_range0(@2(zx400, zx401), @2(zx410, zx411), app(app(app(ty_@3, df), dg), dh), de) → new_range(zx400, zx410, df, dg, dh)
new_foldr2(zx38, zx39, @3(zx400, zx401, zx402), @3(zx410, zx411, zx412), :(zx420, zx421), da, app(app(app(ty_@3, bh), ca), cb), dc) → new_foldr2(zx402, zx412, zx401, zx411, new_range1(zx400, zx410, bh), bh, ca, cb)
new_foldr2(zx38, zx39, @3(zx400, zx401, zx402), @3(zx410, zx411, zx412), :(zx420, zx421), da, app(app(app(ty_@3, app(app(app(ty_@3, cc), cd), ce)), ca), cb), dc) → new_range(zx400, zx410, cc, cd, ce)
new_range0(@2(zx400, zx401), @2(zx410, zx411), dd, de) → new_foldr1(zx401, zx411, new_range3(zx400, zx410, dd), dd, de)
new_range(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), app(app(ty_@2, cf), cg), ca, cb) → new_range0(zx400, zx410, cf, cg)
new_foldr2(zx38, zx39, zx40, zx41, :(zx420, zx421), da, db, dc) → new_foldr2(zx38, zx39, zx40, zx41, zx421, da, db, dc)
new_foldr1(zx47, zx48, :(zx490, zx491), ba, bg) → new_foldr1(zx47, zx48, zx491, ba, bg)
new_range(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), bh, ca, cb) → new_foldr2(zx402, zx412, zx401, zx411, new_range1(zx400, zx410, bh), bh, ca, cb)
new_range(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), app(app(app(ty_@3, cc), cd), ce), ca, cb) → new_range(zx400, zx410, cc, cd, ce)
new_foldr2(zx38, zx39, zx40, zx41, :(zx420, zx421), da, db, dc) → new_foldr3(zx420, zx38, zx39, new_range2(zx40, zx41, db), da, db, dc)
new_foldr3(zx101, zx102, zx103, :(zx1040, zx1041), ec, ed, ee) → new_foldr3(zx101, zx102, zx103, zx1041, ec, ed, ee)
new_foldr2(zx38, zx39, @2(zx400, zx401), @2(zx410, zx411), :(zx420, zx421), da, app(app(ty_@2, dd), de), dc) → new_foldr1(zx401, zx411, new_range3(zx400, zx410, dd), dd, de)
new_foldr3(zx101, zx102, zx103, :(zx1040, zx1041), ec, ed, app(app(ty_@2, fa), fb)) → new_range0(zx102, zx103, fa, fb)
new_foldr2(zx38, zx39, @3(zx400, zx401, zx402), @3(zx410, zx411, zx412), :(zx420, zx421), da, app(app(app(ty_@3, app(app(ty_@2, cf), cg)), ca), cb), dc) → new_range0(zx400, zx410, cf, cg)
new_foldr3(zx101, zx102, zx103, :(zx1040, zx1041), ec, ed, app(app(app(ty_@3, ef), eg), eh)) → new_range(zx102, zx103, ef, eg, eh)
new_foldr1(zx47, zx48, :(zx490, zx491), ba, app(app(app(ty_@3, bb), bc), bd)) → new_range(zx47, zx48, bb, bc, bd)
new_foldr1(zx47, zx48, :(zx490, zx491), ba, app(app(ty_@2, be), bf)) → new_range0(zx47, zx48, be, bf)

The TRS R consists of the following rules:

new_foldr9(zx109, [], fc, fd) → new_foldr10(fc, fd)
new_takeWhile112(zx444, zx445) → :(Integer(Pos(Succ(zx445))), new_takeWhile9(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445)))))
new_range13(zx47, zx48, ty_Integer) → new_range8(zx47, zx48)
new_range3(zx400, zx410, ty_@0) → new_range4(zx400, zx410)
new_primIntToChar(Neg(Succ(zx30000))) → error([])
new_range5(zx102, zx103, ty_Int) → new_range10(zx102, zx103)
new_takeWhile7(Pos(Succ(zx31000)), Pos(Zero)) → :(Pos(Zero), new_takeWhile21(Succ(zx31000), new_ps0, new_ps0))
new_psPs2(:(zx1260, zx1261), zx89, ba, bg) → :(zx1260, new_psPs2(zx1261, zx89, ba, bg))
new_range11(LT, GT) → :(LT, :(EQ, :(GT, new_foldr7)))
new_range3(zx400, zx410, app(app(app(ty_@3, df), dg), dh)) → new_range6(zx400, zx410, df, dg, dh)
new_foldr4(zx101, zx102, zx103, :(zx1040, zx1041), ec, ed, ee) → new_psPs1(new_foldr5(zx101, zx1040, new_range5(zx102, zx103, ee), ec, ed, ee), new_foldr4(zx101, zx102, zx103, zx1041, ec, ed, ee), ec, ed, ee)
new_range3(zx400, zx410, ty_Ordering) → new_range11(zx400, zx410)
new_foldr8(zx38, zx39, zx40, zx41, :(zx420, zx421), da, db, dc) → new_psPs1(new_foldr4(zx420, zx38, zx39, new_range2(zx40, zx41, db), da, db, dc), new_foldr8(zx38, zx39, zx40, zx41, zx421, da, db, dc), da, db, dc)
new_range12(True, True) → :(True, new_foldr12)
new_foldr5(zx144, zx145, [], ff, fg, fh) → new_foldr6(ff, fg, fh)
new_map0(:(zx300, zx301)) → :(new_primIntToChar(zx300), new_map0(zx301))
new_takeWhile8(Integer(Neg(zx31000)), Integer(Pos(Succ(zx300000)))) → []
new_range3(zx400, zx410, ty_Bool) → new_range12(zx400, zx410)
new_foldr11(zx47, zx48, [], ba, bg) → new_foldr10(ba, bg)
new_range2(zx40, zx41, ty_Int) → new_range10(zx40, zx41)
new_range13(zx47, zx48, ty_Ordering) → new_range11(zx47, zx48)
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_range11(LT, EQ) → :(LT, :(EQ, new_foldr7))
new_range5(zx102, zx103, ty_Bool) → new_range12(zx102, zx103)
new_range13(zx47, zx48, app(app(ty_@2, be), bf)) → new_range7(zx47, zx48, be, bf)
new_takeWhile19(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile112(zx444, zx445)
new_range1(zx400, zx410, ty_Bool) → new_range12(zx400, zx410)
new_foldr7 → []
new_takeWhile113(zx435, zx436, zx437, Succ(zx4380), Zero) → []
new_takeWhile19(zx444, zx445, Succ(zx4460), Zero) → []
new_foldr5(zx144, zx145, :(zx1460, zx1461), ff, fg, fh) → new_psPs1(:(@3(zx144, zx145, zx1460), []), new_foldr5(zx144, zx145, zx1461, ff, fg, fh), ff, fg, fh)
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → :(Integer(Neg(Succ(zx300000))), new_takeWhile20(new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000)))))
new_takeWhile22(zx173, zx172) → new_takeWhile7(Neg(Zero), zx172)
new_takeWhile7(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile110(zx31000, zx30000, new_ps(zx30000), zx30000, zx31000)
new_takeWhile19(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile19(zx444, zx445, zx4460, zx4470)
new_range12(False, False) → :(False, new_foldr12)
new_range13(zx47, zx48, ty_Int) → new_range10(zx47, zx48)
new_takeWhile18(zx487, zx488) → :(Integer(Neg(Succ(zx488))), new_takeWhile23(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488)))))
new_range1(zx400, zx410, ty_Char) → new_range9(zx400, zx410)
new_primIntToChar(Pos(zx3000)) → Char(zx3000)
new_range11(GT, LT) → new_foldr7
new_range13(zx47, zx48, ty_Char) → new_range9(zx47, zx48)
new_takeWhile7(Pos(Zero), Pos(Succ(zx30000))) → []
new_range2(zx40, zx41, ty_Char) → new_range9(zx40, zx41)
new_range11(GT, EQ) → new_psPs3
new_range2(zx40, zx41, app(app(app(ty_@3, bh), ca), cb)) → new_range6(zx40, zx41, bh, ca, cb)
new_foldr10(ba, bg) → []
new_range1(zx400, zx410, ty_Int) → new_range10(zx400, zx410)
new_takeWhile113(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile113(zx435, zx436, zx437, zx4380, zx4390)
new_range9(zx300, zx310) → new_map0(new_enumFromTo(new_fromEnum(zx300), new_fromEnum(zx310)))
new_range11(EQ, EQ) → :(EQ, new_foldr7)
new_takeWhile8(Integer(Neg(Zero)), Integer(Pos(Zero))) → :(Integer(Pos(Zero)), new_takeWhile20(new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))))
new_range6(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), bh, ca, cb) → new_foldr8(zx402, zx412, zx401, zx411, new_range1(zx400, zx410, bh), bh, ca, cb)
new_range11(EQ, GT) → :(EQ, :(GT, new_foldr7))
new_takeWhile8(Integer(Neg(Succ(zx310000))), Integer(Neg(Zero))) → []
new_takeWhile114(zx435, zx436, zx437) → :(Neg(Succ(zx436)), new_takeWhile7(Neg(Succ(zx435)), zx437))
new_takeWhile17(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile17(zx487, zx488, zx4890, zx4900)
new_range2(zx40, zx41, ty_Bool) → new_range12(zx40, zx41)
new_takeWhile8(Integer(Neg(Succ(zx310000))), Integer(Pos(Zero))) → []
new_range3(zx400, zx410, ty_Integer) → new_range8(zx400, zx410)
new_takeWhile7(Pos(Succ(zx31000)), Neg(Zero)) → :(Neg(Zero), new_takeWhile21(Succ(zx31000), new_ps2, new_ps2))
new_takeWhile8(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile17(zx310000, zx300000, zx310000, zx300000)
new_takeWhile7(Neg(Succ(zx31000)), Neg(Zero)) → []
new_foldr9(zx109, :(zx1100, zx1101), fc, fd) → new_psPs2(:(@2(zx109, zx1100), []), new_foldr9(zx109, zx1101, fc, fd), fc, fd)
new_takeWhile8(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → :(Integer(Neg(Succ(zx300000))), new_takeWhile9(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000)))))
new_psPs3 → new_foldr7
new_range3(zx400, zx410, app(app(ty_@2, ea), eb)) → new_range7(zx400, zx410, ea, eb)
new_psPs2([], zx89, ba, bg) → zx89
new_takeWhile7(Pos(Zero), Neg(Zero)) → :(Neg(Zero), new_takeWhile21(Zero, new_ps2, new_ps2))
new_range5(zx102, zx103, ty_Integer) → new_range8(zx102, zx103)
new_range2(zx40, zx41, ty_Ordering) → new_range11(zx40, zx41)
new_enumFromTo(zx300, zx310) → new_takeWhile7(zx310, zx300)
new_takeWhile7(Neg(Zero), Neg(Zero)) → :(Neg(Zero), new_takeWhile22(new_ps2, new_ps2))
new_takeWhile111(zx429, zx430, zx431) → :(Pos(Succ(zx430)), new_takeWhile21(Succ(zx429), zx431, zx431))
new_takeWhile7(Neg(Succ(zx31000)), Pos(Zero)) → []
new_foldr11(zx47, zx48, :(zx490, zx491), ba, bg) → new_psPs2(new_foldr9(zx490, new_range13(zx47, zx48, bg), ba, bg), new_foldr11(zx47, zx48, zx491, ba, bg), ba, bg)
new_foldr4(zx101, zx102, zx103, [], ec, ed, ee) → new_foldr6(ec, ed, ee)
new_range1(zx400, zx410, ty_Integer) → new_range8(zx400, zx410)
new_takeWhile9(zx31000, zx196, zx195) → new_takeWhile8(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile7(Neg(zx3100), Pos(Succ(zx30000))) → []
new_range12(False, True) → :(False, :(True, new_foldr12))
new_range2(zx40, zx41, app(app(ty_@2, dd), de)) → new_range7(zx40, zx41, dd, de)
new_range2(zx40, zx41, ty_Integer) → new_range8(zx40, zx41)
new_range3(zx400, zx410, ty_Char) → new_range9(zx400, zx410)
new_range5(zx102, zx103, app(app(ty_@2, fa), fb)) → new_range7(zx102, zx103, fa, fb)
new_ps0 → new_primPlusInt13(Pos(Zero))
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Succ(zx300000)))) → []
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_takeWhile7(Pos(Zero), Pos(Zero)) → :(Pos(Zero), new_takeWhile21(Zero, new_ps0, new_ps0))
new_foldr12 → []
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_range3(zx400, zx410, ty_Int) → new_range10(zx400, zx410)
new_range1(zx400, zx410, ty_@0) → new_range4(zx400, zx410)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_takeWhile8(Integer(Pos(Zero)), Integer(Neg(Zero))) → :(Integer(Neg(Zero)), new_takeWhile9(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))))
new_takeWhile7(Neg(Zero), Neg(Succ(zx30000))) → :(Neg(Succ(zx30000)), new_takeWhile22(new_ps1(zx30000), new_ps1(zx30000)))
new_takeWhile8(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile19(zx310000, zx300000, zx300000, zx310000)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_takeWhile17(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile18(zx487, zx488)
new_takeWhile110(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile110(zx429, zx430, zx431, zx4320, zx4330)
new_range1(zx400, zx410, app(app(ty_@2, cf), cg)) → new_range7(zx400, zx410, cf, cg)
new_psPs1([], zx88, da, db, dc) → zx88
new_psPs1(:(zx1050, zx1051), zx88, da, db, dc) → :(zx1050, new_psPs1(zx1051, zx88, da, db, dc))
new_primIntToChar(Neg(Zero)) → Char(Zero)
new_range5(zx102, zx103, ty_Char) → new_range9(zx102, zx103)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_takeWhile113(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile114(zx435, zx436, zx437)
new_range1(zx400, zx410, ty_Ordering) → new_range11(zx400, zx410)
new_range2(zx40, zx41, ty_@0) → new_range4(zx40, zx41)
new_takeWhile17(zx487, zx488, Succ(zx4890), Zero) → []
new_range8(zx300, zx310) → new_takeWhile8(zx310, zx300)
new_range7(@2(zx400, zx401), @2(zx410, zx411), dd, de) → new_foldr11(zx401, zx411, new_range3(zx400, zx410, dd), dd, de)
new_range1(zx400, zx410, app(app(app(ty_@3, cc), cd), ce)) → new_range6(zx400, zx410, cc, cd, ce)
new_takeWhile17(zx487, zx488, Zero, Zero) → new_takeWhile18(zx487, zx488)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_takeWhile7(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile113(zx31000, zx30000, new_ps1(zx30000), zx31000, zx30000)
new_range4(@0, @0) → :(@0, [])
new_takeWhile8(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → :(Integer(Pos(Zero)), new_takeWhile9(Succ(zx310000), new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))))
new_foldr8(zx38, zx39, zx40, zx41, [], da, db, dc) → new_foldr6(da, db, dc)
new_range11(GT, GT) → :(GT, new_foldr7)
new_fromEnum(Char(zx3000)) → Pos(zx3000)
new_takeWhile8(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → :(Integer(Neg(Zero)), new_takeWhile9(Succ(zx310000), new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))))
new_range5(zx102, zx103, app(app(app(ty_@3, ef), eg), eh)) → new_range6(zx102, zx103, ef, eg, eh)
new_takeWhile113(zx435, zx436, zx437, Zero, Zero) → new_takeWhile114(zx435, zx436, zx437)
new_primMinusNat1(Zero) → Pos(Zero)
new_takeWhile110(zx429, zx430, zx431, Succ(zx4320), Zero) → []
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Zero))) → :(Integer(Neg(Zero)), new_takeWhile20(new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))))
new_takeWhile19(zx444, zx445, Zero, Zero) → new_takeWhile112(zx444, zx445)
new_takeWhile20(zx212, zx211) → new_takeWhile8(Integer(Neg(Zero)), Integer(zx211))
new_takeWhile110(zx429, zx430, zx431, Zero, Zero) → new_takeWhile111(zx429, zx430, zx431)
new_takeWhile110(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile111(zx429, zx430, zx431)
new_foldr6(da, db, dc) → []
new_range13(zx47, zx48, app(app(app(ty_@3, bb), bc), bd)) → new_range6(zx47, zx48, bb, bc, bd)
new_range13(zx47, zx48, ty_Bool) → new_range12(zx47, zx48)
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Zero))) → :(Integer(Pos(Zero)), new_takeWhile9(Zero, new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))))
new_range10(zx300, zx310) → new_enumFromTo(zx300, zx310)
new_takeWhile21(zx3100, zx166, zx165) → new_takeWhile7(Pos(zx3100), zx165)
new_range12(True, False) → new_foldr12
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_takeWhile7(Pos(zx3100), Neg(Succ(zx30000))) → :(Neg(Succ(zx30000)), new_takeWhile21(zx3100, new_ps1(zx30000), new_ps1(zx30000)))
new_takeWhile23(zx487, zx520, zx519) → new_takeWhile8(Integer(Neg(Succ(zx487))), Integer(zx519))
new_takeWhile7(Neg(Zero), Pos(Zero)) → :(Pos(Zero), new_takeWhile22(new_ps0, new_ps0))
new_range5(zx102, zx103, ty_Ordering) → new_range11(zx102, zx103)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_range5(zx102, zx103, ty_@0) → new_range4(zx102, zx103)
new_range11(LT, LT) → :(LT, new_foldr7)
new_map0([]) → []
new_ps2 → new_primPlusInt13(Neg(Zero))
new_range13(zx47, zx48, ty_@0) → new_range4(zx47, zx48)
new_range11(EQ, LT) → new_foldr7
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_range3(x0, x1, ty_Integer)
new_takeWhile22(x0, x1)
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Zero)))
new_psPs2([], x0, x1, x2)
new_range13(x0, x1, ty_Ordering)
new_foldr8(x0, x1, x2, x3, :(x4, x5), x6, x7, x8)
new_foldr12
new_range2(x0, x1, ty_Char)
new_range7(@2(x0, x1), @2(x2, x3), x4, x5)
new_takeWhile17(x0, x1, Succ(x2), Zero)
new_takeWhile113(x0, x1, x2, Succ(x3), Succ(x4))
new_takeWhile8(Integer(Pos(Succ(x0))), Integer(Pos(Zero)))
new_primIntToChar(Neg(Succ(x0)))
new_ps1(x0)
new_range13(x0, x1, ty_Bool)
new_range1(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_psPs1([], x0, x1, x2, x3)
new_range11(GT, LT)
new_range11(LT, GT)
new_takeWhile8(Integer(Neg(x0)), Integer(Pos(Succ(x1))))
new_takeWhile8(Integer(Pos(x0)), Integer(Neg(Succ(x1))))
new_foldr4(x0, x1, x2, :(x3, x4), x5, x6, x7)
new_takeWhile7(Pos(Zero), Pos(Zero))
new_range1(x0, x1, ty_Integer)
new_takeWhile110(x0, x1, x2, Zero, Succ(x3))
new_takeWhile110(x0, x1, x2, Succ(x3), Zero)
new_takeWhile8(Integer(Neg(Succ(x0))), Integer(Neg(Zero)))
new_takeWhile23(x0, x1, x2)
new_takeWhile7(Pos(Succ(x0)), Pos(Succ(x1)))
new_takeWhile7(Neg(Zero), Neg(Succ(x0)))
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Succ(x0))))
new_primPlusNat1(Zero, x0)
new_takeWhile7(Neg(Zero), Neg(Zero))
new_takeWhile110(x0, x1, x2, Zero, Zero)
new_range13(x0, x1, ty_@0)
new_takeWhile7(Pos(Succ(x0)), Neg(Zero))
new_takeWhile7(Neg(Succ(x0)), Pos(Zero))
new_takeWhile7(Neg(Succ(x0)), Neg(Zero))
new_ps0
new_takeWhile19(x0, x1, Zero, Succ(x2))
new_primPlusInt13(Neg(Succ(x0)))
new_enumFromTo(x0, x1)
new_takeWhile7(Pos(x0), Neg(Succ(x1)))
new_takeWhile17(x0, x1, Succ(x2), Succ(x3))
new_takeWhile7(Neg(x0), Pos(Succ(x1)))
new_takeWhile113(x0, x1, x2, Succ(x3), Zero)
new_range12(True, True)
new_range3(x0, x1, ty_Char)
new_range13(x0, x1, app(app(ty_@2, x2), x3))
new_primMinusNat1(Zero)
new_takeWhile110(x0, x1, x2, Succ(x3), Succ(x4))
new_range11(GT, GT)
new_range5(x0, x1, ty_Bool)
new_range11(EQ, EQ)
new_range13(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_range3(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_map0(:(x0, x1))
new_takeWhile111(x0, x1, x2)
new_takeWhile7(Pos(Zero), Pos(Succ(x0)))
new_foldr11(x0, x1, [], x2, x3)
new_takeWhile113(x0, x1, x2, Zero, Zero)
new_takeWhile112(x0, x1)
new_range11(GT, EQ)
new_range1(x0, x1, ty_Bool)
new_range11(EQ, GT)
new_range6(@3(x0, x1, x2), @3(x3, x4, x5), x6, x7, x8)
new_range11(EQ, LT)
new_range11(LT, EQ)
new_primPlusNat0(Succ(x0), Zero)
new_range8(x0, x1)
new_range5(x0, x1, ty_Integer)
new_range12(True, False)
new_range12(False, True)
new_range9(x0, x1)
new_range5(x0, x1, app(app(ty_@2, x2), x3))
new_primPlusInt13(Pos(x0))
new_primPlusNat0(Succ(x0), Succ(x1))
new_primMinusNat1(Succ(x0))
new_range3(x0, x1, ty_Bool)
new_range1(x0, x1, app(app(ty_@2, x2), x3))
new_foldr9(x0, :(x1, x2), x3, x4)
new_takeWhile17(x0, x1, Zero, Zero)
new_range5(x0, x1, ty_Char)
new_range11(LT, LT)
new_foldr7
new_takeWhile19(x0, x1, Zero, Zero)
new_primIntToChar(Pos(x0))
new_range10(x0, x1)
new_primPlusInt13(Neg(Zero))
new_primPlusNat1(Succ(x0), x1)
new_takeWhile17(x0, x1, Zero, Succ(x2))
new_range3(x0, x1, app(app(ty_@2, x2), x3))
new_range2(x0, x1, ty_Ordering)
new_takeWhile7(Pos(Succ(x0)), Pos(Zero))
new_takeWhile18(x0, x1)
new_primIntToChar(Neg(Zero))
new_takeWhile19(x0, x1, Succ(x2), Succ(x3))
new_range4(@0, @0)
new_foldr4(x0, x1, x2, [], x3, x4, x5)
new_range2(x0, x1, app(app(ty_@2, x2), x3))
new_ps(x0)
new_range1(x0, x1, ty_Char)
new_foldr5(x0, x1, :(x2, x3), x4, x5, x6)
new_takeWhile114(x0, x1, x2)
new_map0([])
new_takeWhile113(x0, x1, x2, Zero, Succ(x3))
new_range2(x0, x1, ty_Bool)
new_range1(x0, x1, ty_Ordering)
new_primPlusNat0(Zero, Zero)
new_ps2
new_foldr5(x0, x1, [], x2, x3, x4)
new_range5(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_foldr11(x0, x1, :(x2, x3), x4, x5)
new_range5(x0, x1, ty_@0)
new_psPs2(:(x0, x1), x2, x3, x4)
new_primPlusNat0(Zero, Succ(x0))
new_takeWhile9(x0, x1, x2)
new_takeWhile8(Integer(Neg(Zero)), Integer(Pos(Zero)))
new_takeWhile8(Integer(Pos(Zero)), Integer(Neg(Zero)))
new_foldr8(x0, x1, x2, x3, [], x4, x5, x6)
new_foldr6(x0, x1, x2)
new_range13(x0, x1, ty_Int)
new_takeWhile20(x0, x1)
new_range1(x0, x1, ty_@0)
new_foldr10(x0, x1)
new_range2(x0, x1, ty_Integer)
new_range2(x0, x1, ty_Int)
new_psPs3
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Succ(x0))))
new_takeWhile8(Integer(Pos(Succ(x0))), Integer(Neg(Zero)))
new_range13(x0, x1, ty_Char)
new_takeWhile8(Integer(Neg(Succ(x0))), Integer(Pos(Zero)))
new_range5(x0, x1, ty_Int)
new_takeWhile21(x0, x1, x2)
new_takeWhile8(Integer(Pos(Succ(x0))), Integer(Pos(Succ(x1))))
new_takeWhile7(Neg(Succ(x0)), Neg(Succ(x1)))
new_takeWhile8(Integer(Neg(Succ(x0))), Integer(Neg(Succ(x1))))
new_takeWhile7(Neg(Zero), Pos(Zero))
new_range2(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_takeWhile7(Pos(Zero), Neg(Zero))
new_range5(x0, x1, ty_Ordering)
new_range12(False, False)
new_psPs1(:(x0, x1), x2, x3, x4, x5)
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Zero)))
new_foldr9(x0, [], x1, x2)
new_range13(x0, x1, ty_Integer)
new_range1(x0, x1, ty_Int)
new_range2(x0, x1, ty_@0)
new_takeWhile19(x0, x1, Succ(x2), Zero)
new_range3(x0, x1, ty_@0)
new_fromEnum(Char(x0))
new_range3(x0, x1, ty_Int)
new_range3(x0, x1, ty_Ordering)

We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_range0(@2(zx400, zx401), @2(zx410, zx411), app(app(ty_@2, ea), eb), de) → new_range0(zx400, zx410, ea, eb)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4
new_range(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), app(app(ty_@2, cf), cg), ca, cb) → new_range0(zx400, zx410, cf, cg)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4
new_range(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), bh, ca, cb) → new_foldr2(zx402, zx412, zx401, zx411, new_range1(zx400, zx410, bh), bh, ca, cb)
The graph contains the following edges 1 > 1, 2 > 2, 1 > 3, 2 > 4, 3 >= 6, 4 >= 7, 5 >= 8
new_range(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), app(app(app(ty_@3, cc), cd), ce), ca, cb) → new_range(zx400, zx410, cc, cd, ce)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4, 3 > 5
new_foldr1(zx47, zx48, :(zx490, zx491), ba, app(app(ty_@2, be), bf)) → new_range0(zx47, zx48, be, bf)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 > 3, 5 > 4
new_foldr3(zx101, zx102, zx103, :(zx1040, zx1041), ec, ed, app(app(ty_@2, fa), fb)) → new_range0(zx102, zx103, fa, fb)
The graph contains the following edges 2 >= 1, 3 >= 2, 7 > 3, 7 > 4
new_range0(@2(zx400, zx401), @2(zx410, zx411), app(app(app(ty_@3, df), dg), dh), de) → new_range(zx400, zx410, df, dg, dh)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4, 3 > 5
new_range0(@2(zx400, zx401), @2(zx410, zx411), dd, de) → new_foldr1(zx401, zx411, new_range3(zx400, zx410, dd), dd, de)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 4, 4 >= 5
new_foldr1(zx47, zx48, :(zx490, zx491), ba, app(app(app(ty_@3, bb), bc), bd)) → new_range(zx47, zx48, bb, bc, bd)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 > 3, 5 > 4, 5 > 5
new_foldr1(zx47, zx48, :(zx490, zx491), ba, bg) → new_foldr1(zx47, zx48, zx491, ba, bg)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 >= 4, 5 >= 5
new_foldr3(zx101, zx102, zx103, :(zx1040, zx1041), ec, ed, app(app(app(ty_@3, ef), eg), eh)) → new_range(zx102, zx103, ef, eg, eh)
The graph contains the following edges 2 >= 1, 3 >= 2, 7 > 3, 7 > 4, 7 > 5
new_foldr3(zx101, zx102, zx103, :(zx1040, zx1041), ec, ed, ee) → new_foldr3(zx101, zx102, zx103, zx1041, ec, ed, ee)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 >= 5, 6 >= 6, 7 >= 7
new_foldr2(zx38, zx39, @2(zx400, zx401), @2(zx410, zx411), :(zx420, zx421), da, app(app(ty_@2, dd), de), dc) → new_foldr1(zx401, zx411, new_range3(zx400, zx410, dd), dd, de)
The graph contains the following edges 3 > 1, 4 > 2, 7 > 4, 7 > 5
new_foldr2(zx38, zx39, zx40, zx41, :(zx420, zx421), da, db, dc) → new_foldr3(zx420, zx38, zx39, new_range2(zx40, zx41, db), da, db, dc)
The graph contains the following edges 5 > 1, 1 >= 2, 2 >= 3, 6 >= 5, 7 >= 6, 8 >= 7
new_foldr2(zx38, zx39, @2(zx400, zx401), @2(zx410, zx411), :(zx420, zx421), da, app(app(ty_@2, app(app(ty_@2, ea), eb)), de), dc) → new_range0(zx400, zx410, ea, eb)
The graph contains the following edges 3 > 1, 4 > 2, 7 > 3, 7 > 4
new_foldr2(zx38, zx39, @3(zx400, zx401, zx402), @3(zx410, zx411, zx412), :(zx420, zx421), da, app(app(app(ty_@3, app(app(ty_@2, cf), cg)), ca), cb), dc) → new_range0(zx400, zx410, cf, cg)
The graph contains the following edges 3 > 1, 4 > 2, 7 > 3, 7 > 4
new_foldr2(zx38, zx39, @3(zx400, zx401, zx402), @3(zx410, zx411, zx412), :(zx420, zx421), da, app(app(app(ty_@3, bh), ca), cb), dc) → new_foldr2(zx402, zx412, zx401, zx411, new_range1(zx400, zx410, bh), bh, ca, cb)
The graph contains the following edges 3 > 1, 4 > 2, 3 > 3, 4 > 4, 7 > 6, 7 > 7, 7 > 8
new_foldr2(zx38, zx39, zx40, zx41, :(zx420, zx421), da, db, dc) → new_foldr2(zx38, zx39, zx40, zx41, zx421, da, db, dc)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 > 5, 6 >= 6, 7 >= 7, 8 >= 8
new_foldr2(zx38, zx39, @2(zx400, zx401), @2(zx410, zx411), :(zx420, zx421), da, app(app(ty_@2, app(app(app(ty_@3, df), dg), dh)), de), dc) → new_range(zx400, zx410, df, dg, dh)
The graph contains the following edges 3 > 1, 4 > 2, 7 > 3, 7 > 4, 7 > 5
new_foldr2(zx38, zx39, @3(zx400, zx401, zx402), @3(zx410, zx411, zx412), :(zx420, zx421), da, app(app(app(ty_@3, app(app(app(ty_@3, cc), cd), ce)), ca), cb), dc) → new_range(zx400, zx410, cc, cd, ce)
The graph contains the following edges 3 > 1, 4 > 2, 7 > 3, 7 > 4, 7 > 5

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_range14(@3(zx3000, zx3001, zx3002), @3(zx3100, zx3101, zx3102), app(app(app(ty_@3, ba), bb), bc), bd, be) → new_range14(zx3000, zx3100, ba, bb, bc)
new_range15(@2(zx3000, zx3001), @2(zx3100, zx3101), app(app(ty_@2, cd), ce), cc) → new_range15(zx3000, zx3100, cd, ce)
new_range14(@3(zx3000, zx3001, zx3002), @3(zx3100, zx3101, zx3102), app(app(ty_@2, bf), bg), bd, be) → new_range15(zx3000, zx3100, bf, bg)
new_range15(@2(zx3000, zx3001), @2(zx3100, zx3101), app(app(app(ty_@3, bh), ca), cb), cc) → new_range14(zx3000, zx3100, bh, ca, cb)

From the DPs we obtained the following set of size-change graphs:

new_range15(@2(zx3000, zx3001), @2(zx3100, zx3101), app(app(ty_@2, cd), ce), cc) → new_range15(zx3000, zx3100, cd, ce)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4
new_range15(@2(zx3000, zx3001), @2(zx3100, zx3101), app(app(app(ty_@3, bh), ca), cb), cc) → new_range14(zx3000, zx3100, bh, ca, cb)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4, 3 > 5
new_range14(@3(zx3000, zx3001, zx3002), @3(zx3100, zx3101, zx3102), app(app(ty_@2, bf), bg), bd, be) → new_range15(zx3000, zx3100, bf, bg)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4
new_range14(@3(zx3000, zx3001, zx3002), @3(zx3100, zx3101, zx3102), app(app(app(ty_@3, ba), bb), bc), bd, be) → new_range14(zx3000, zx3100, ba, bb, bc)
The graph contains the following edges 1 > 1, 2 > 2, 3 > 3, 3 > 4, 3 > 5

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm1(zx698, zx37811) → new_enforceWHNF1(zx698, zx698, zx37811)
new_enforceWHNF1(zx690, zx689, :(zx37810, zx37811)) → new_dsEm1(new_primPlusInt14(zx689, zx37810), zx37811)

The TRS R consists of the following rules:

new_primPlusInt14(Pos(zx4600), True) → new_primPlusInt2(zx4600)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt14(Neg(zx4600), False) → new_primPlusInt13(Neg(zx4600))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusInt2(zx4590) → new_primPlusInt3(zx4590)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primPlusInt4(zx4590) → new_primPlusInt0(zx4590)
new_primPlusInt3(zx4590) → new_primPlusInt5(zx4590)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primMinusNat0(Succ(zx160000), Zero) → Pos(Succ(zx160000))
new_primPlusInt0(zx4590) → new_primPlusInt1(zx4590)
new_primPlusInt14(Neg(zx4600), True) → new_primPlusInt4(zx4600)
new_primPlusInt14(Pos(zx4600), False) → new_primPlusInt13(Pos(zx4600))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat0(Succ(zx160000), Succ(zx15800)) → new_primMinusNat0(zx160000, zx15800)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt2(x0)
new_primPlusInt4(x0)
new_primPlusNat1(Succ(x0), x1)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt0(x0)
new_primPlusInt14(Neg(x0), False)
new_primPlusInt14(Neg(x0), True)
new_primPlusInt14(Pos(x0), False)
new_primMinusNat1(Zero)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt1(x0)
new_primPlusInt14(Pos(x0), True)
new_primMinusNat0(Zero, Zero)
new_primPlusInt3(x0)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusInt5(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm1(zx698, zx37811) → new_enforceWHNF1(zx698, zx698, zx37811)
new_enforceWHNF1(zx690, zx689, :(zx37810, zx37811)) → new_dsEm1(new_primPlusInt14(zx689, zx37810), zx37811)

The TRS R consists of the following rules:

new_primPlusInt14(Pos(zx4600), True) → new_primPlusInt2(zx4600)
new_primPlusInt14(Neg(zx4600), False) → new_primPlusInt13(Neg(zx4600))
new_primPlusInt14(Neg(zx4600), True) → new_primPlusInt4(zx4600)
new_primPlusInt14(Pos(zx4600), False) → new_primPlusInt13(Pos(zx4600))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusInt4(zx4590) → new_primPlusInt0(zx4590)
new_primPlusInt0(zx4590) → new_primPlusInt1(zx4590)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt2(zx4590) → new_primPlusInt3(zx4590)
new_primPlusInt3(zx4590) → new_primPlusInt5(zx4590)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusInt2(x0)
new_primPlusInt4(x0)
new_primPlusNat1(Succ(x0), x1)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt0(x0)
new_primPlusInt14(Neg(x0), False)
new_primPlusInt14(Neg(x0), True)
new_primPlusInt14(Pos(x0), False)
new_primMinusNat1(Zero)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt1(x0)
new_primPlusInt14(Pos(x0), True)
new_primMinusNat0(Zero, Zero)
new_primPlusInt3(x0)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusInt5(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_enforceWHNF1(zx690, zx689, :(zx37810, zx37811)) → new_dsEm1(new_primPlusInt14(zx689, zx37810), zx37811)
The graph contains the following edges 3 > 2
new_dsEm1(zx698, zx37811) → new_enforceWHNF1(zx698, zx698, zx37811)
The graph contains the following edges 1 >= 1, 1 >= 2, 2 >= 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm2(zx679, zx36211) → new_enforceWHNF2(zx679, zx679, zx36211)
new_enforceWHNF2(zx672, zx671, :(zx36210, zx36211)) → new_dsEm2(new_primPlusInt15(zx671, zx36210), zx36211)

The TRS R consists of the following rules:

new_primPlusInt15(Pos(zx4560), GT) → new_primPlusInt9(zx4560)
new_primPlusInt16(zx4550) → new_primPlusInt13(Neg(zx4550))
new_primPlusInt15(Neg(zx4560), EQ) → new_primPlusInt16(zx4560)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusInt15(Neg(zx4560), GT) → new_primPlusInt8(zx4560)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt15(Neg(zx4560), LT) → new_primPlusInt16(zx4560)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt15(Pos(zx4560), EQ) → new_primPlusInt17(zx4560)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusInt12(zx4740) → new_primPlusInt5(zx4740)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt15(Pos(zx4560), LT) → new_primPlusInt17(zx4560)
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusInt8(zx4740) → new_primPlusInt7(zx4740)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt9(zx4740) → new_primPlusInt12(zx4740)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primMinusNat0(Succ(zx160000), Zero) → Pos(Succ(zx160000))
new_primPlusInt17(zx4550) → new_primPlusInt13(Pos(zx4550))
new_primPlusInt7(zx4740) → new_primPlusInt1(zx4740)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primMinusNat0(Succ(zx160000), Succ(zx15800)) → new_primMinusNat0(zx160000, zx15800)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt15(Neg(x0), GT)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Succ(x0), x1)
new_primPlusInt7(x0)
new_primPlusInt17(x0)
new_primMinusNat1(Zero)
new_primPlusInt15(Pos(x0), EQ)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusInt15(Pos(x0), GT)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusInt9(x0)
new_primPlusInt16(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt15(Pos(x0), LT)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primPlusInt12(x0)
new_primPlusInt15(Neg(x0), LT)
new_primMinusNat1(Succ(x0))
new_primPlusInt15(Neg(x0), EQ)
new_primPlusInt5(x0)
new_primPlusInt8(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_dsEm2(zx679, zx36211) → new_enforceWHNF2(zx679, zx679, zx36211)
new_enforceWHNF2(zx672, zx671, :(zx36210, zx36211)) → new_dsEm2(new_primPlusInt15(zx671, zx36210), zx36211)

The TRS R consists of the following rules:

new_primPlusInt15(Pos(zx4560), GT) → new_primPlusInt9(zx4560)
new_primPlusInt15(Neg(zx4560), EQ) → new_primPlusInt16(zx4560)
new_primPlusInt15(Neg(zx4560), GT) → new_primPlusInt8(zx4560)
new_primPlusInt15(Neg(zx4560), LT) → new_primPlusInt16(zx4560)
new_primPlusInt15(Pos(zx4560), EQ) → new_primPlusInt17(zx4560)
new_primPlusInt15(Pos(zx4560), LT) → new_primPlusInt17(zx4560)
new_primPlusInt17(zx4550) → new_primPlusInt13(Pos(zx4550))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt16(zx4550) → new_primPlusInt13(Neg(zx4550))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt8(zx4740) → new_primPlusInt7(zx4740)
new_primPlusInt7(zx4740) → new_primPlusInt1(zx4740)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusInt9(zx4740) → new_primPlusInt12(zx4740)
new_primPlusInt12(zx4740) → new_primPlusInt5(zx4740)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt15(Neg(x0), GT)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Succ(x0), x1)
new_primPlusInt7(x0)
new_primPlusInt17(x0)
new_primMinusNat1(Zero)
new_primPlusInt15(Pos(x0), EQ)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusInt15(Pos(x0), GT)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusInt9(x0)
new_primPlusInt16(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt15(Pos(x0), LT)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusNat1(Zero, x0)
new_primPlusInt12(x0)
new_primPlusInt15(Neg(x0), LT)
new_primMinusNat1(Succ(x0))
new_primPlusInt15(Neg(x0), EQ)
new_primPlusInt5(x0)
new_primPlusInt8(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_enforceWHNF2(zx672, zx671, :(zx36210, zx36211)) → new_dsEm2(new_primPlusInt15(zx671, zx36210), zx36211)
The graph contains the following edges 3 > 2
new_dsEm2(zx679, zx36211) → new_enforceWHNF2(zx679, zx679, zx36211)
The graph contains the following edges 1 >= 1, 1 >= 2, 2 >= 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_enforceWHNF3(zx668, zx667, :(zx36110, zx36111)) → new_dsEm3(new_primPlusInt18(zx667, zx36110), zx36111)
new_dsEm3(zx676, zx36111) → new_enforceWHNF3(zx676, zx676, zx36111)

The TRS R consists of the following rules:

new_primPlusInt16(zx4550) → new_primPlusInt13(Neg(zx4550))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusInt18(Pos(zx4550), EQ) → new_primPlusInt9(zx4550)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusInt18(Neg(zx4550), EQ) → new_primPlusInt8(zx4550)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt10(zx4740) → new_primPlusInt12(zx4740)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusInt18(Neg(zx4550), LT) → new_primPlusInt16(zx4550)
new_primPlusInt12(zx4740) → new_primPlusInt5(zx4740)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusInt8(zx4740) → new_primPlusInt7(zx4740)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt9(zx4740) → new_primPlusInt12(zx4740)
new_primPlusInt18(Pos(zx4550), GT) → new_primPlusInt10(zx4550)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primMinusNat0(Succ(zx160000), Zero) → Pos(Succ(zx160000))
new_primPlusInt17(zx4550) → new_primPlusInt13(Pos(zx4550))
new_primPlusInt18(Pos(zx4550), LT) → new_primPlusInt17(zx4550)
new_primPlusInt7(zx4740) → new_primPlusInt1(zx4740)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt11(zx4740) → new_primPlusInt7(zx4740)
new_primMinusNat0(Succ(zx160000), Succ(zx15800)) → new_primMinusNat0(zx160000, zx15800)
new_primPlusInt18(Neg(zx4550), GT) → new_primPlusInt11(zx4550)
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt18(Neg(x0), LT)
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt18(Pos(x0), GT)
new_primPlusInt11(x0)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Succ(x0), x1)
new_primPlusInt7(x0)
new_primPlusInt17(x0)
new_primMinusNat1(Zero)
new_primPlusInt10(x0)
new_primPlusInt18(Neg(x0), EQ)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusInt9(x0)
new_primPlusInt16(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt18(Pos(x0), EQ)
new_primPlusInt18(Pos(x0), LT)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusInt12(x0)
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusInt18(Neg(x0), GT)
new_primPlusInt5(x0)
new_primPlusInt8(x0)

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QDPSizeChangeProof

                                  ↳ QDP

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_enforceWHNF3(zx668, zx667, :(zx36110, zx36111)) → new_dsEm3(new_primPlusInt18(zx667, zx36110), zx36111)
new_dsEm3(zx676, zx36111) → new_enforceWHNF3(zx676, zx676, zx36111)

The TRS R consists of the following rules:

new_primPlusInt18(Pos(zx4550), EQ) → new_primPlusInt9(zx4550)
new_primPlusInt18(Neg(zx4550), EQ) → new_primPlusInt8(zx4550)
new_primPlusInt18(Neg(zx4550), LT) → new_primPlusInt16(zx4550)
new_primPlusInt18(Pos(zx4550), GT) → new_primPlusInt10(zx4550)
new_primPlusInt18(Pos(zx4550), LT) → new_primPlusInt17(zx4550)
new_primPlusInt18(Neg(zx4550), GT) → new_primPlusInt11(zx4550)
new_primPlusInt11(zx4740) → new_primPlusInt7(zx4740)
new_primPlusInt7(zx4740) → new_primPlusInt1(zx4740)
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primPlusInt17(zx4550) → new_primPlusInt13(Pos(zx4550))
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusInt10(zx4740) → new_primPlusInt12(zx4740)
new_primPlusInt12(zx4740) → new_primPlusInt5(zx4740)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primPlusInt16(zx4550) → new_primPlusInt13(Neg(zx4550))
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_primMinusNat1(Zero) → Pos(Zero)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_primPlusInt8(zx4740) → new_primPlusInt7(zx4740)
new_primPlusInt9(zx4740) → new_primPlusInt12(zx4740)

The set Q consists of the following terms:

new_primPlusInt13(Neg(Zero))
new_primPlusInt18(Neg(x0), LT)
new_primPlusInt13(Neg(Succ(x0)))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt18(Pos(x0), GT)
new_primPlusInt11(x0)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusNat1(Succ(x0), x1)
new_primPlusInt7(x0)
new_primPlusInt17(x0)
new_primMinusNat1(Zero)
new_primPlusInt10(x0)
new_primPlusInt18(Neg(x0), EQ)
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt1(x0)
new_primMinusNat0(Zero, Zero)
new_primMinusNat0(Zero, Succ(x0))
new_primPlusInt9(x0)
new_primPlusInt16(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusInt18(Pos(x0), EQ)
new_primPlusInt18(Pos(x0), LT)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))
new_primPlusInt13(Pos(x0))
new_primPlusInt12(x0)
new_primPlusNat1(Zero, x0)
new_primMinusNat1(Succ(x0))
new_primPlusInt18(Neg(x0), GT)
new_primPlusInt5(x0)
new_primPlusInt8(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_dsEm3(zx676, zx36111) → new_enforceWHNF3(zx676, zx676, zx36111)
The graph contains the following edges 1 >= 1, 1 >= 2, 2 >= 3
new_enforceWHNF3(zx668, zx667, :(zx36110, zx36111)) → new_dsEm3(new_primPlusInt18(zx667, zx36110), zx36111)
The graph contains the following edges 3 > 2

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                                  ↳ QDP

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_rangeSize1(zx385, zx386, Succ(zx3870), Succ(zx3880)) → new_rangeSize1(zx385, zx386, zx3870, zx3880)

From the DPs we obtained the following set of size-change graphs:

new_rangeSize1(zx385, zx386, Succ(zx3870), Succ(zx3880)) → new_rangeSize1(zx385, zx386, zx3870, zx3880)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ LetRed

                        ↳ HASKELL

                          ↳ NumRed

                            ↳ HASKELL

                              ↳ Narrow

                                ↳ AND

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_rangeSize12(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg) → new_ps5(zx63, zx66, zx62, zx65, bf, be)
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, app(app(app(ty_@3, fg), fh), ga), ef, eg, eh) → new_index2(zx81, zx83, fg, fh, ga)
new_primPlusInt19(Neg(zx1360), zx137, zx138, zx139, app(app(app(ty_@3, cg), da), db)) → new_rangeSize(@2(zx137, zx138), cg, da, db)
new_rangeSize12(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg) → new_primPlusInt19(new_index(zx64, zx67, bg), zx64, zx67, new_ps3(zx63, zx66, zx62, zx65, bf, be), bg)
new_rangeSize15(zx81, zx82, zx83, zx84, ee, app(app(ty_@2, fd), ff)) → new_index3(zx82, zx84, fd, ff)
new_rangeSize0(@2(@2(zx300, zx301), @2(zx310, zx311)), dh, ea) → new_rangeSize13(zx300, zx301, zx310, zx311, new_range18(zx300, zx310, dh), dh, ea, dh)
new_ps4(zx64, zx67, zx63, zx66, zx62, zx65, bg, bf, be) → new_primPlusInt19(new_index(zx64, zx67, bg), zx64, zx67, new_ps3(zx63, zx66, zx62, zx65, bf, be), bg)
new_primPlusInt19(Pos(zx1360), zx137, zx138, zx139, app(app(ty_@2, dc), dd)) → new_rangeSize0(@2(zx137, zx138), dc, dd)
new_ps5(zx82, zx84, zx81, zx83, app(app(app(ty_@3, fa), fb), fc), ee) → new_index2(zx82, zx84, fa, fb, fc)
new_rangeSize11(zx62, zx63, zx64, zx65, zx66, zx67, :(zx900, zx901), zx70, be, bf, bg, bh, ca) → new_ps5(zx63, zx66, zx62, zx65, bf, be)
new_rangeSize11(zx62, zx63, @2(zx640, zx641), zx65, zx66, @2(zx670, zx671), :(zx900, zx901), zx70, be, bf, app(app(ty_@2, ce), cf), bh, ca) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)
new_primPlusInt19(Pos(zx1360), zx137, zx138, zx139, app(app(app(ty_@3, cg), da), db)) → new_rangeSize(@2(zx137, zx138), cg, da, db)
new_rangeSize11(zx62, zx63, zx64, zx65, zx66, zx67, [], :(zx700, zx701), be, bf, bg, bh, ca) → new_rangeSize12(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg)
new_rangeSize12(zx62, zx63, @3(zx640, zx641, zx642), zx65, zx66, @3(zx670, zx671, zx672), be, bf, app(app(app(ty_@3, cb), cc), cd)) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, ee, ef, eg, eh) → new_primPlusInt19(new_index0(zx82, zx84, ef), zx82, zx84, new_index1(zx81, zx83, ee), ef)
new_primPlusInt19(Neg(zx1360), zx137, zx138, zx139, app(app(ty_@2, dc), dd)) → new_rangeSize0(@2(zx137, zx138), dc, dd)
new_index3(@2(zx640, zx641), @2(zx670, zx671), ce, cf) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)
new_rangeSize15(zx81, zx82, zx83, zx84, app(app(ty_@2, gb), gc), ef) → new_index3(zx81, zx83, gb, gc)
new_rangeSize11(zx62, zx63, zx64, zx65, zx66, zx67, :(zx900, zx901), zx70, be, bf, bg, bh, ca) → new_primPlusInt19(new_index(zx64, zx67, bg), zx64, zx67, new_ps3(zx63, zx66, zx62, zx65, bf, be), bg)
new_rangeSize10(zx12, zx13, zx14, zx15, zx16, zx17, :(zx180, zx181), ba, bb, bc, bd) → new_rangeSize11(zx12, zx13, zx14, zx15, zx16, zx17, new_foldr4(zx180, zx14, zx17, new_range16(zx13, zx16, bb), bd, bb, bc), new_foldr8(zx14, zx17, zx13, zx16, zx181, bd, bb, bc), ba, bb, bc, bd, bb)
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, ee, app(app(ty_@2, fd), ff), eg, eh) → new_index3(zx82, zx84, fd, ff)
new_rangeSize11(zx62, zx63, @3(zx640, zx641, zx642), zx65, zx66, @3(zx670, zx671, zx672), :(zx900, zx901), zx70, be, bf, app(app(app(ty_@3, cb), cc), cd), bh, ca) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
new_rangeSize15(zx81, zx82, zx83, zx84, ee, app(app(app(ty_@3, fa), fb), fc)) → new_index2(zx82, zx84, fa, fb, fc)
new_ps5(zx82, zx84, zx81, zx83, ef, ee) → new_primPlusInt19(new_index0(zx82, zx84, ef), zx82, zx84, new_index1(zx81, zx83, ee), ef)
new_rangeSize(@2(@3(zx300, zx301, zx302), @3(zx310, zx311, zx312)), de, df, dg) → new_rangeSize10(zx300, zx301, zx302, zx310, zx311, zx312, new_range17(zx300, zx310, de), de, df, dg, de)
new_index2(@3(zx640, zx641, zx642), @3(zx670, zx671, zx672), cb, cc, cd) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
new_ps4(@2(zx640, zx641), @2(zx670, zx671), zx63, zx66, zx62, zx65, app(app(ty_@2, ce), cf), bf, be) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, ee, app(app(app(ty_@3, fa), fb), fc), eg, eh) → new_index2(zx82, zx84, fa, fb, fc)
new_rangeSize14(zx81, zx82, zx83, zx84, [], :(zx870, zx871), ee, ef, eg, eh) → new_rangeSize15(zx81, zx82, zx83, zx84, ee, ef)
new_rangeSize13(zx25, zx26, zx27, zx28, :(zx290, zx291), eb, ec, ed) → new_rangeSize14(zx25, zx26, zx27, zx28, new_foldr9(zx290, new_range19(zx26, zx28, ec), ed, ec), new_foldr11(zx26, zx28, zx291, ed, ec), eb, ec, ed, ec)
new_rangeSize15(zx81, zx82, zx83, zx84, ee, ef) → new_primPlusInt19(new_index0(zx82, zx84, ef), zx82, zx84, new_index1(zx81, zx83, ee), ef)
new_ps5(zx82, zx84, zx81, zx83, ef, app(app(ty_@2, gb), gc)) → new_index3(zx81, zx83, gb, gc)
new_ps5(zx82, zx84, zx81, zx83, ef, app(app(app(ty_@3, fg), fh), ga)) → new_index2(zx81, zx83, fg, fh, ga)
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, app(app(ty_@2, gb), gc), ef, eg, eh) → new_index3(zx81, zx83, gb, gc)
new_rangeSize15(zx81, zx82, zx83, zx84, app(app(app(ty_@3, fg), fh), ga), ef) → new_index2(zx81, zx83, fg, fh, ga)
new_ps4(@3(zx640, zx641, zx642), @3(zx670, zx671, zx672), zx63, zx66, zx62, zx65, app(app(app(ty_@3, cb), cc), cd), bf, be) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
new_ps5(zx82, zx84, zx81, zx83, app(app(ty_@2, fd), ff), ee) → new_index3(zx82, zx84, fd, ff)
new_ps4(zx64, zx67, zx63, zx66, zx62, zx65, bg, bf, be) → new_ps5(zx63, zx66, zx62, zx65, bf, be)
new_rangeSize12(zx62, zx63, @2(zx640, zx641), zx65, zx66, @2(zx670, zx671), be, bf, app(app(ty_@2, ce), cf)) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)

The TRS R consists of the following rules:

new_takeWhile112(zx444, zx445) → :(Integer(Pos(Succ(zx445))), new_takeWhile9(Succ(zx444), new_primPlusInt13(Pos(Succ(zx445))), new_primPlusInt13(Pos(Succ(zx445)))))
new_dsEm10(zx459, zx3640, zx3641) → new_enforceWHNF8(new_primPlusInt(zx459, zx3640), new_primPlusInt(zx459, zx3640), zx3641)
new_range13(zx47, zx48, ty_Integer) → new_range8(zx47, zx48)
new_primPlusInt22(zx151, Pos(zx1520), Neg(zx1530)) → new_primPlusInt23(zx151, zx1520, zx1530)
new_primPlusInt22(zx151, Neg(zx1520), Pos(zx1530)) → new_primPlusInt23(zx151, zx1520, zx1530)
new_range3(zx400, zx410, ty_@0) → new_range4(zx400, zx410)
new_primPlusInt6(Pos(zx4740), EQ) → new_primPlusInt10(zx4740)
new_index128(zx631, zx632, Zero, Zero) → new_index126(zx631, zx632)
new_index817(zx30, zx31, Succ(zx176000), Succ(zx129000)) → new_index817(zx30, zx31, zx176000, zx129000)
new_primPlusInt6(Neg(zx4740), LT) → new_primPlusInt8(zx4740)
new_foldr8(zx38, zx39, zx40, zx41, :(zx420, zx421), bbh, bca, bcb) → new_psPs1(new_foldr4(zx420, zx38, zx39, new_range2(zx40, zx41, bca), bbh, bca, bcb), new_foldr8(zx38, zx39, zx40, zx41, zx421, bbh, bca, bcb), bbh, bca, bcb)
new_range12(True, True) → :(True, new_foldr12)
new_primPlusInt18(Neg(zx4550), EQ) → new_primPlusInt8(zx4550)
new_primMinusNat3(zx16000, Zero) → Pos(Succ(zx16000))
new_foldr5(zx144, zx145, [], baa, bab, bac) → new_foldr6(baa, bab, bac)
new_index83(zx30, zx31, Neg(Zero), zx129) → new_index87(zx30, zx31, new_fromEnum(zx31), zx129)
new_map0(:(zx300, zx301)) → :(new_primIntToChar(zx300), new_map0(zx301))
new_ps6(zx64, zx67, zx63, zx66, zx62, zx65, bg, bf, be) → new_primPlusInt26(new_index(zx64, zx67, bg), zx64, zx67, new_ps3(zx63, zx66, zx62, zx65, bf, be), bg)
new_range18(zx300, zx310, ty_Char) → new_range9(zx300, zx310)
new_range23(zx3000, zx3100, app(app(ty_@2, beg), beh)) → new_range21(zx3000, zx3100, beg, beh)
new_primPlusInt6(Neg(zx4740), GT) → new_primPlusInt11(zx4740)
new_primPlusInt23(Succ(zx1510), Zero, Zero) → new_primMinusNat4(zx1510)
new_dsEm5(zx698, zx37811) → new_enforceWHNF4(zx698, zx698, zx37811)
new_foldr7 → []
new_index83(zx30, zx31, Neg(Succ(zx13000)), zx129) → new_index86(zx30, zx31, zx13000, new_fromEnum(zx31), zx129)
new_index14(True, False) → new_error
new_primPlusInt7(zx4740) → new_primPlusInt1(zx4740)
new_index127(zx704, zx705, Succ(zx7060)) → new_index127(zx704, zx705, zx7060)
new_rangeSize9(zx137, zx138, app(app(app(ty_@3, cg), da), db)) → new_rangeSize2(@2(zx137, zx138), cg, da, db)
new_range13(zx47, zx48, ty_Int) → new_range10(zx47, zx48)
new_index14(True, True) → new_sum2(new_range12(True, True))
new_index817(zx30, zx31, Zero, Zero) → new_index814(zx30, zx31)
new_rangeSize21(@2(Pos(Zero), Pos(Zero))) → new_ps7(new_index1216(Pos(Zero), Pos(Zero)))
new_range22(zx3000, zx3100, ty_Bool) → new_range12(zx3000, zx3100)
new_range11(GT, EQ) → new_psPs3
new_index1(zx81, zx83, ty_Bool) → new_index14(zx81, zx83)
new_index129(zx544, Succ(zx5450)) → new_index129(zx544, zx5450)
new_index510(Integer(Pos(Succ(zx64000))), Integer(Pos(Zero))) → new_error
new_primMinusNat5(zx1510, Zero, zx15300) → new_primMinusNat3(zx1510, Succ(zx15300))
new_takeWhile114(zx435, zx436, zx437) → :(Neg(Succ(zx436)), new_takeWhile7(Neg(Succ(zx435)), zx437))
new_index88(zx30, zx31, Succ(zx16300), zx13000, zx129) → new_index816(zx30, zx31, zx16300, zx13000, zx129)
new_rangeSize119(zx62, zx63, zx64, zx65, zx66, zx67, [], :(zx700, zx701), be, bf, bg, bh, ca) → new_rangeSize113(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg)
new_foldr9(zx109, :(zx1100, zx1101), bgf, bgg) → new_psPs2(:(@2(zx109, zx1100), []), new_foldr9(zx109, zx1101, bgf, bgg), bgf, bgg)
new_index511(zx652, zx653, Succ(zx6540), Succ(zx6550)) → new_index511(zx652, zx653, zx6540, zx6550)
new_rangeSize20(zx137, zx138, ty_Ordering) → new_rangeSize6(@2(zx137, zx138))
new_index810(zx30, zx31) → new_error
new_range18(zx300, zx310, ty_@0) → new_range4(zx300, zx310)
new_index513(zx568, Zero) → new_fromInteger(new_primMinusInt(Pos(Succ(zx568)), Neg(Zero)))
new_sum2([]) → new_foldl'
new_range23(zx3000, zx3100, ty_Integer) → new_range8(zx3000, zx3100)
new_range20(@3(zx3000, zx3001, zx3002), @3(zx3100, zx3101, zx3102), gd, ge, gf) → new_foldr8(zx3002, zx3102, zx3001, zx3101, new_range23(zx3000, zx3100, gd), gd, ge, gf)
new_index1214(Pos(Succ(zx6400)), Neg(zx670)) → new_error
new_index1(zx81, zx83, app(app(app(ty_@3, fg), fh), ga)) → new_index4(zx81, zx83, fg, fh, ga)
new_takeWhile7(Pos(Zero), Neg(Zero)) → :(Neg(Zero), new_takeWhile21(Zero, new_ps2, new_ps2))
new_primPlusNat2(Zero, Succ(zx15200), Zero) → new_primPlusNat5(Zero)
new_primPlusNat2(Zero, Zero, Succ(zx15300)) → new_primPlusNat5(Zero)
new_index514(zx692, zx693, Zero) → new_fromInteger(new_primMinusInt(Pos(Succ(zx693)), Pos(Succ(zx692))))
new_rangeSize114(zx81, zx82, zx83, zx84, [], :(zx870, zx871), ee, ef, eg, eh) → new_rangeSize115(zx81, zx82, zx83, zx84, ee, ef)
new_index510(Integer(Neg(Succ(zx64000))), Integer(Neg(Zero))) → new_fromInteger(new_primMinusInt(Neg(Zero), Neg(Succ(zx64000))))
new_takeWhile111(zx429, zx430, zx431) → :(Pos(Succ(zx430)), new_takeWhile21(Succ(zx429), zx431, zx431))
new_takeWhile7(Neg(Succ(zx31000)), Pos(Zero)) → []
new_foldr11(zx47, zx48, :(zx490, zx491), bba, bbb) → new_psPs2(new_foldr9(zx490, new_range13(zx47, zx48, bbb), bba, bbb), new_foldr11(zx47, zx48, zx491, bba, bbb), bba, bbb)
new_rangeSize111(zx385, zx386, Succ(zx3870), Succ(zx3880)) → new_rangeSize111(zx385, zx386, zx3870, zx3880)
new_foldr4(zx101, zx102, zx103, [], bfa, bfb, bfc) → new_foldr6(bfa, bfb, bfc)
new_primMinusInt(Pos(zx2380), Pos(zx2370)) → new_primMinusNat0(zx2380, zx2370)
new_primPlusInt15(Neg(zx4560), EQ) → new_primPlusInt16(zx4560)
new_range1(zx400, zx410, ty_Integer) → new_range8(zx400, zx410)
new_range18(zx300, zx310, app(app(ty_@2, bag), bah)) → new_range21(zx300, zx310, bag, bah)
new_index510(Integer(Pos(Zero)), Integer(Pos(Zero))) → new_fromInteger(new_primMinusInt(Pos(Zero), Pos(Zero)))
new_range2(zx40, zx41, ty_Integer) → new_range8(zx40, zx41)
new_index129(zx544, Zero) → new_ms(Pos(Succ(zx544)), Neg(Zero))
new_index14(False, False) → new_sum3(new_range12(False, False))
new_rangeSize20(zx137, zx138, ty_Int) → new_rangeSize21(@2(zx137, zx138))
new_index1214(Neg(Succ(zx6400)), Neg(Zero)) → new_ms(Neg(Zero), Neg(Succ(zx6400)))
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Neg(Zero)))) → new_ps7(new_index60(Integer(Neg(Zero)), Integer(Neg(Zero))))
new_rangeSize6(@2(EQ, GT)) → new_ps7(new_index13(EQ, GT))
new_index0(zx82, zx84, ty_@0) → new_index9(zx82, zx84)
new_range18(zx300, zx310, ty_Ordering) → new_range11(zx300, zx310)
new_index87(zx30, zx31, Neg(Succ(zx16400)), zx129) → new_index811(zx30, zx31, zx16400, Zero, zx129)
new_index510(Integer(Pos(Zero)), Integer(Neg(Succ(zx67000)))) → new_error
new_primPlusInt1(zx4740) → new_primMinusNat0(Zero, zx4740)
new_takeWhile8(Integer(Pos(Zero)), Integer(Neg(Zero))) → :(Integer(Neg(Zero)), new_takeWhile9(Zero, new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))))
new_index511(zx652, zx653, Succ(zx6540), Zero) → new_error
new_takeWhile8(Integer(Pos(Succ(zx310000))), Integer(Pos(Succ(zx300000)))) → new_takeWhile19(zx310000, zx300000, zx300000, zx310000)
new_primPlusInt24(zx158, Neg(zx1590), Neg(zx1600)) → new_primPlusInt20(zx158, zx1590, zx1600)
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Pos(Succ(zx31000))))) → new_ps7(new_index60(Integer(Neg(Zero)), Integer(Pos(Succ(zx31000)))))
new_rangeSize16(zx12, zx13, zx14, zx15, zx16, zx17, :(zx180, zx181), ba, bb, bc, bd) → new_rangeSize119(zx12, zx13, zx14, zx15, zx16, zx17, new_foldr4(zx180, zx14, zx17, new_range16(zx13, zx16, bb), bd, bb, bc), new_foldr8(zx14, zx17, zx13, zx16, zx181, bd, bb, bc), ba, bb, bc, bd, bb)
new_takeWhile17(zx487, zx488, Zero, Succ(zx4900)) → new_takeWhile18(zx487, zx488)
new_primPlusInt8(zx4740) → new_primPlusInt7(zx4740)
new_takeWhile110(zx429, zx430, zx431, Succ(zx4320), Succ(zx4330)) → new_takeWhile110(zx429, zx430, zx431, zx4320, zx4330)
new_rangeSize9(zx137, zx138, app(app(ty_@2, dc), dd)) → new_rangeSize4(@2(zx137, zx138), dc, dd)
new_index820(zx30, zx31, Succ(zx12900), zx17600) → new_index817(zx30, zx31, zx12900, zx17600)
new_primPlusInt5(zx4740) → Pos(new_primPlusNat0(zx4740, Zero))
new_primMinusNat2(Succ(zx2130), zx16000, Zero) → Pos(Succ(Succ(new_primPlusNat0(zx2130, zx16000))))
new_rangeSize19(zx380, zx381, :(zx3970, zx3971)) → new_ps7(new_index7(Integer(Pos(Succ(zx380))), Integer(Pos(Succ(zx381)))))
new_psPs1([], zx88, bbh, bca, bcb) → zx88
new_index0(zx82, zx84, ty_Char) → new_index10(zx82, zx84)
new_rangeSize118(zx291, zx292, []) → Pos(Zero)
new_index0(zx82, zx84, ty_Bool) → new_index14(zx82, zx84)
new_primPlusInt24(zx158, Pos(zx1590), Neg(zx1600)) → new_primPlusInt25(zx158, zx1590, zx1600)
new_primPlusInt24(zx158, Neg(zx1590), Pos(zx1600)) → new_primPlusInt25(zx158, zx1590, zx1600)
new_index1(zx81, zx83, ty_Ordering) → new_index13(zx81, zx83)
new_primPlusNat5(Succ(zx127000)) → Succ(zx127000)
new_range22(zx3000, zx3100, app(app(ty_@2, bde), bdf)) → new_range21(zx3000, zx3100, bde, bdf)
new_primPlusInt22(zx151, Pos(zx1520), Pos(zx1530)) → new_primPlusInt21(zx151, zx1520, zx1530)
new_primPlusInt26(Pos(zx1360), zx137, zx138, zx139, bgh) → new_primPlusInt22(zx1360, new_rangeSize9(zx137, zx138, bgh), zx139)
new_index83(zx30, zx31, Pos(Zero), zx129) → new_index85(zx30, zx31, new_fromEnum(zx31), zx129)
new_range16(zx13, zx16, ty_Bool) → new_range12(zx13, zx16)
new_rangeSize111(zx385, zx386, Zero, Succ(zx3880)) → new_rangeSize112(zx385, zx386)
new_index821(zx30, zx31, Pos(Zero), Pos(Zero)) → new_index814(zx30, zx31)
new_range11(GT, GT) → :(GT, new_foldr7)
new_takeWhile110(zx429, zx430, zx431, Succ(zx4320), Zero) → []
new_index128(zx631, zx632, Succ(zx6330), Zero) → new_error
new_index811(zx30, zx31, zx13000, Zero, zx129) → new_index812(zx30, zx31, zx129)
new_primPlusNat3(zx1510, Succ(zx2410), zx15300) → new_primPlusNat1(Succ(zx1510), Succ(new_primPlusNat0(zx2410, zx15300)))
new_rangeSize20(zx137, zx138, ty_@0) → new_rangeSize3(@2(zx137, zx138))
new_range13(zx47, zx48, ty_Bool) → new_range12(zx47, zx48)
new_index1212(zx700, zx701, Succ(zx7020)) → new_index1212(zx700, zx701, zx7020)
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Zero))) → :(Integer(Pos(Zero)), new_takeWhile9(Zero, new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))))
new_index817(zx30, zx31, Zero, Succ(zx129000)) → new_index818(zx30, zx31)
new_range10(zx300, zx310) → new_enumFromTo(zx300, zx310)
new_index57(zx556, Succ(zx5570)) → new_index57(zx556, zx5570)
new_sum0([]) → new_foldl'
new_range17(zx300, zx310, app(app(app(ty_@3, gd), ge), gf)) → new_range20(zx300, zx310, gd, ge, gf)
new_index0(zx82, zx84, app(app(ty_@2, fd), ff)) → new_index6(zx82, zx84, fd, ff)
new_rangeSize19(zx380, zx381, []) → Pos(Zero)
new_primPlusNat4(Succ(zx2430), zx15300) → new_primPlusNat0(Zero, Succ(Succ(new_primPlusNat0(zx2430, zx15300))))
new_takeWhile7(Pos(zx3100), Neg(Succ(zx30000))) → :(Neg(Succ(zx30000)), new_takeWhile21(zx3100, new_ps1(zx30000), new_ps1(zx30000)))
new_range5(zx102, zx103, ty_Ordering) → new_range11(zx102, zx103)
new_range5(zx102, zx103, ty_@0) → new_range4(zx102, zx103)
new_range11(LT, LT) → :(LT, new_foldr7)
new_index1213(zx525, Zero) → new_ms(Pos(Succ(zx525)), Pos(Zero))
new_range13(zx47, zx48, ty_@0) → new_range4(zx47, zx48)
new_rangeSize7(@2(Integer(Pos(Succ(zx30000))), Integer(Neg(zx3100)))) → Pos(Zero)
new_rangeSize8(@2(zx30, zx31)) → new_rangeSize117(zx30, zx31, new_range9(zx30, zx31))
new_dsEm8(zx673, zx36011) → new_enforceWHNF7(zx673, zx673, zx36011)
new_primPlusInt(Neg(zx4590), False) → new_primPlusInt4(zx4590)
new_rangeSize9(zx137, zx138, ty_Char) → new_rangeSize8(@2(zx137, zx138))
new_index82(zx30, zx31, zx129) → new_index821(zx30, zx31, new_fromEnum(zx31), zx129)
new_index(zx64, zx67, ty_Bool) → new_index14(zx64, zx67)
new_rangeSize20(zx137, zx138, ty_Char) → new_rangeSize8(@2(zx137, zx138))
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Pos(Succ(zx31000))))) → new_ps7(new_index7(Integer(Pos(Zero)), Integer(Pos(Succ(zx31000)))))
new_primMulNat0(Succ(zx159000), zx16000) → new_primPlusNat1(new_primMulNat0(zx159000, zx16000), zx16000)
new_index0(zx82, zx84, ty_Integer) → new_index7(zx82, zx84)
new_index1217(zx64, zx67) → new_index1216(zx64, zx67)
new_range19(zx26, zx28, ty_Ordering) → new_range11(zx26, zx28)
new_primPlusInt6(Neg(zx4740), EQ) → new_primPlusInt11(zx4740)
new_rangeSize7(@2(Integer(Neg(Succ(zx30000))), Integer(Neg(Zero)))) → new_ps7(new_index7(Integer(Neg(Succ(zx30000))), Integer(Neg(Zero))))
new_range11(LT, GT) → :(LT, :(EQ, :(GT, new_foldr7)))
new_rangeSize2(@2(@3(zx300, zx301, zx302), @3(zx310, zx311, zx312)), de, df, dg) → new_rangeSize16(zx300, zx301, zx302, zx310, zx311, zx312, new_range17(zx300, zx310, de), de, df, dg, de)
new_foldr4(zx101, zx102, zx103, :(zx1040, zx1041), bfa, bfb, bfc) → new_psPs1(new_foldr5(zx101, zx1040, new_range5(zx102, zx103, bfc), bfa, bfb, bfc), new_foldr4(zx101, zx102, zx103, zx1041, bfa, bfb, bfc), bfa, bfb, bfc)
new_index(zx64, zx67, app(app(ty_@2, ce), cf)) → new_index6(zx64, zx67, ce, cf)
new_range3(zx400, zx410, ty_Ordering) → new_range11(zx400, zx410)
new_range3(zx400, zx410, ty_Bool) → new_range12(zx400, zx410)
new_index1(zx81, zx83, ty_@0) → new_index9(zx81, zx83)
new_range13(zx47, zx48, ty_Ordering) → new_range11(zx47, zx48)
new_index9(@0, @0) → Pos(Zero)
new_primMinusNat2(Zero, zx16000, zx158) → new_primMinusNat3(zx16000, zx158)
new_ps(zx3000) → new_primPlusInt13(Pos(Succ(zx3000)))
new_rangeSize6(@2(GT, EQ)) → new_rangeSize18(new_psPs3)
new_index510(Integer(Pos(Succ(zx64000))), Integer(Pos(Succ(zx67000)))) → new_index511(zx64000, zx67000, zx64000, zx67000)
new_range11(LT, EQ) → :(LT, :(EQ, new_foldr7))
new_range5(zx102, zx103, ty_Bool) → new_range12(zx102, zx103)
new_range13(zx47, zx48, app(app(ty_@2, beb), bec)) → new_range7(zx47, zx48, beb, bec)
new_rangeSize112(zx385, zx386) → new_ps7(new_index7(Integer(Neg(Succ(zx385))), Integer(Neg(Succ(zx386)))))
new_index1(zx81, zx83, ty_Integer) → new_index7(zx81, zx83)
new_index510(Integer(Pos(Zero)), Integer(Pos(Succ(zx67000)))) → new_index57(zx67000, Succ(zx67000))
new_index512(zx652, zx653) → new_index514(zx652, zx653, Succ(zx653))
new_takeWhile19(zx444, zx445, Zero, Succ(zx4470)) → new_takeWhile112(zx444, zx445)
new_rangeSize111(zx385, zx386, Succ(zx3870), Zero) → Pos(Zero)
new_foldl' → new_fromInt
new_index1215(zx504, zx505, Zero) → new_ms(Pos(Succ(zx505)), Neg(Succ(zx504)))
new_index1214(Neg(Succ(zx6400)), Pos(Zero)) → new_ms(Pos(Zero), Neg(Succ(zx6400)))
new_dsEm12(zx688, zx36411) → new_enforceWHNF8(zx688, zx688, zx36411)
new_index1214(Neg(Succ(zx6400)), Neg(Succ(zx6700))) → new_index128(zx6400, zx6700, zx6700, zx6400)
new_primPlusInt14(Pos(zx4600), False) → new_primPlusInt13(Pos(zx4600))
new_takeWhile19(zx444, zx445, Succ(zx4460), Succ(zx4470)) → new_takeWhile19(zx444, zx445, zx4460, zx4470)
new_index86(zx30, zx31, zx13000, Pos(zx1630), zx129) → new_index81(zx30, zx31, zx129)
new_enforceWHNF5(zx668, zx667, []) → new_foldl'0(zx667)
new_rangeSize20(zx137, zx138, ty_Integer) → new_rangeSize7(@2(zx137, zx138))
new_primPlusInt18(Neg(zx4550), GT) → new_primPlusInt11(zx4550)
new_rangeSize17(zx353, zx354, []) → Pos(Zero)
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Neg(Succ(zx31000))))) → Pos(Zero)
new_index510(Integer(Neg(Succ(zx64000))), Integer(Pos(Zero))) → new_fromInteger(new_primMinusInt(Pos(Zero), Neg(Succ(zx64000))))
new_primPlusInt14(Pos(zx4600), True) → new_primPlusInt2(zx4600)
new_range1(zx400, zx410, ty_Char) → new_range9(zx400, zx410)
new_rangeSize21(@2(Neg(Zero), Pos(Succ(zx3100)))) → new_ps7(new_index1216(Neg(Zero), Pos(Succ(zx3100))))
new_range2(zx40, zx41, ty_Char) → new_range9(zx40, zx41)
new_takeWhile7(Pos(Zero), Pos(Succ(zx30000))) → []
new_primPlusNat5(Zero) → Zero
new_range1(zx400, zx410, ty_Int) → new_range10(zx400, zx410)
new_index1214(Pos(Zero), Neg(Succ(zx6700))) → new_error
new_index811(zx30, zx31, zx13000, Succ(zx16100), zx129) → new_index816(zx30, zx31, zx13000, zx16100, zx129)
new_index821(zx30, zx31, Neg(Succ(zx17600)), Neg(zx1290)) → new_index820(zx30, zx31, zx1290, zx17600)
new_takeWhile113(zx435, zx436, zx437, Succ(zx4380), Succ(zx4390)) → new_takeWhile113(zx435, zx436, zx437, zx4380, zx4390)
new_enforceWHNF4(zx690, zx689, []) → new_foldl'0(zx689)
new_enforceWHNF6(zx672, zx671, []) → new_foldl'0(zx671)
new_range11(EQ, EQ) → :(EQ, new_foldr7)
new_range11(EQ, GT) → :(EQ, :(GT, new_foldr7))
new_enforceWHNF4(zx690, zx689, :(zx37810, zx37811)) → new_dsEm5(new_primPlusInt14(zx689, zx37810), zx37811)
new_range21(@2(zx3000, zx3001), @2(zx3100, zx3101), gg, gh) → new_foldr11(zx3001, zx3101, new_range22(zx3000, zx3100, gg), gg, gh)
new_index13(EQ, EQ) → new_sum(new_range11(EQ, EQ))
new_takeWhile8(Integer(Neg(Succ(zx310000))), Integer(Neg(Succ(zx300000)))) → new_takeWhile17(zx310000, zx300000, zx310000, zx300000)
new_index510(Integer(Neg(Succ(zx64000))), Integer(Neg(Succ(zx67000)))) → new_index58(zx64000, zx67000, zx67000, zx64000)
new_takeWhile7(Neg(Succ(zx31000)), Neg(Zero)) → []
new_sum0(:(zx3600, zx3601)) → new_seq(new_fromInt, zx3600, new_fromInt, zx3601)
new_index510(Integer(Neg(Zero)), Integer(Neg(Succ(zx67000)))) → new_error
new_index819(zx30, zx31, zx17600, Succ(zx12900)) → new_index817(zx30, zx31, zx17600, zx12900)
new_range19(zx26, zx28, app(app(ty_@2, bbf), bbg)) → new_range21(zx26, zx28, bbf, bbg)
new_primPlusNat2(Succ(zx1510), Succ(zx15200), Succ(zx15300)) → new_primPlusNat3(zx1510, new_primMulNat0(zx15200, zx15300), zx15300)
new_psPs2([], zx89, bba, bbb) → zx89
new_rangeSize21(@2(Pos(Succ(zx3000)), Pos(Zero))) → Pos(Zero)
new_primPlusInt(Pos(zx4590), True) → new_primPlusInt3(zx4590)
new_range17(zx300, zx310, ty_Ordering) → new_range11(zx300, zx310)
new_takeWhile7(Neg(Zero), Neg(Zero)) → :(Neg(Zero), new_takeWhile22(new_ps2, new_ps2))
new_index510(Integer(Pos(Succ(zx64000))), Integer(Neg(zx6700))) → new_error
new_rangeSize17(zx353, zx354, :(zx3630, zx3631)) → new_ps7(new_index11(Neg(Succ(zx353)), Neg(Succ(zx354))))
new_primPlusNat2(Succ(zx1510), Zero, Zero) → new_primPlusNat5(Succ(zx1510))
new_index(zx64, zx67, ty_Integer) → new_index7(zx64, zx67)
new_index11(zx64, zx67) → new_index1217(zx64, zx67)
new_takeWhile9(zx31000, zx196, zx195) → new_takeWhile8(Integer(Pos(zx31000)), Integer(zx195))
new_takeWhile7(Neg(zx3100), Pos(Succ(zx30000))) → []
new_index10(zx30, zx31) → new_index83(zx30, zx31, new_fromEnum(zx30), new_fromEnum(zx31))
new_range17(zx300, zx310, ty_Bool) → new_range12(zx300, zx310)
new_index0(zx82, zx84, ty_Ordering) → new_index13(zx82, zx84)
new_range16(zx13, zx16, app(app(ty_@2, bgd), bge)) → new_range21(zx13, zx16, bgd, bge)
new_index13(EQ, LT) → new_error
new_primPlusNat1(Zero, zx15300) → Succ(zx15300)
new_range19(zx26, zx28, ty_Int) → new_range10(zx26, zx28)
new_index84(zx30, zx31, zx13000, Neg(zx1610), zx129) → new_index812(zx30, zx31, zx129)
new_range17(zx300, zx310, ty_Int) → new_range10(zx300, zx310)
new_takeWhile7(Neg(Zero), Neg(Succ(zx30000))) → :(Neg(Succ(zx30000)), new_takeWhile22(new_ps1(zx30000), new_ps1(zx30000)))
new_index1214(Neg(Zero), Neg(Zero)) → new_ms(Neg(Zero), Neg(Zero))
new_range23(zx3000, zx3100, ty_Char) → new_range9(zx3000, zx3100)
new_index812(zx30, zx31, zx129) → new_index810(zx30, zx31)
new_primPlusInt9(zx4740) → new_primPlusInt12(zx4740)
new_index13(LT, LT) → new_sum0(new_range11(LT, LT))
new_primMinusNat0(Succ(zx160000), Zero) → Pos(Succ(zx160000))
new_range17(zx300, zx310, ty_Integer) → new_range8(zx300, zx310)
new_primIntToChar(Neg(Zero)) → Char(Zero)
new_range5(zx102, zx103, ty_Char) → new_range9(zx102, zx103)
new_index1210(zx626, zx627, Zero, Succ(zx6290)) → new_index1211(zx626, zx627)
new_index87(zx30, zx31, Pos(Succ(zx16400)), zx129) → new_index81(zx30, zx31, zx129)
new_range18(zx300, zx310, ty_Bool) → new_range12(zx300, zx310)
new_range7(@2(zx400, zx401), @2(zx410, zx411), bcc, bcd) → new_foldr11(zx401, zx411, new_range3(zx400, zx410, bcc), bcc, bcd)
new_takeWhile17(zx487, zx488, Succ(zx4890), Zero) → []
new_index57(zx556, Zero) → new_fromInteger(new_primMinusInt(Pos(Succ(zx556)), Pos(Zero)))
new_index1210(zx626, zx627, Succ(zx6280), Zero) → new_error
new_seq(zx473, zx3600, zx474, zx3601) → new_enforceWHNF7(new_primPlusInt6(zx473, zx3600), new_primPlusInt6(zx474, zx3600), zx3601)
new_range4(@0, @0) → :(@0, [])
new_ps3(zx82, zx84, zx81, zx83, ef, ee) → new_primPlusInt26(new_index0(zx82, zx84, ef), zx82, zx84, new_index1(zx81, zx83, ee), ef)
new_rangeSize20(zx137, zx138, app(app(app(ty_@3, cg), da), db)) → new_rangeSize2(@2(zx137, zx138), cg, da, db)
new_takeWhile8(Integer(Pos(Succ(zx310000))), Integer(Neg(Zero))) → :(Integer(Neg(Zero)), new_takeWhile9(Succ(zx310000), new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))))
new_takeWhile113(zx435, zx436, zx437, Zero, Zero) → new_takeWhile114(zx435, zx436, zx437)
new_index510(Integer(Neg(Zero)), Integer(Neg(Zero))) → new_fromInteger(new_primMinusInt(Neg(Zero), Neg(Zero)))
new_primMinusNat1(Zero) → Pos(Zero)
new_index56(zx708, zx709, Succ(zx7100)) → new_index56(zx708, zx709, zx7100)
new_takeWhile20(zx212, zx211) → new_takeWhile8(Integer(Neg(Zero)), Integer(zx211))
new_range23(zx3000, zx3100, ty_Int) → new_range10(zx3000, zx3100)
new_range13(zx47, zx48, app(app(app(ty_@3, bdg), bdh), bea)) → new_range6(zx47, zx48, bdg, bdh, bea)
new_index1213(zx525, Succ(zx5260)) → new_index1213(zx525, zx5260)
new_index821(zx30, zx31, Neg(Zero), Neg(Zero)) → new_index814(zx30, zx31)
new_takeWhile21(zx3100, zx166, zx165) → new_takeWhile7(Pos(zx3100), zx165)
new_range12(True, False) → new_foldr12
new_primPlusInt23(Zero, Succ(zx15200), Zero) → new_primMinusNat1(Zero)
new_primPlusInt23(Zero, Zero, Succ(zx15300)) → new_primMinusNat1(Zero)
new_rangeSize9(zx137, zx138, ty_Int) → new_rangeSize21(@2(zx137, zx138))
new_range16(zx13, zx16, ty_@0) → new_range4(zx13, zx16)
new_rangeSize5(@2(False, False)) → new_ps7(new_index14(False, False))
new_rangeSize21(@2(Neg(Succ(zx3000)), Neg(Succ(zx3100)))) → new_rangeSize17(zx3000, zx3100, new_takeWhile113(zx3100, zx3000, new_ps1(zx3000), zx3100, zx3000))
new_takeWhile7(Neg(Zero), Pos(Zero)) → :(Pos(Zero), new_takeWhile22(new_ps0, new_ps0))
new_primPlusNat0(Succ(zx24500), Zero) → Succ(zx24500)
new_primPlusNat0(Zero, Succ(zx153000)) → Succ(zx153000)
new_map0([]) → []
new_index515(zx531, zx532, Zero) → new_fromInteger(new_primMinusInt(Pos(Succ(zx532)), Neg(Succ(zx531))))
new_rangeSize117(zx30, zx31, []) → Pos(Zero)
new_rangeSize6(@2(LT, LT)) → new_ps7(new_index13(LT, LT))
new_rangeSize114(zx81, zx82, zx83, zx84, [], [], ee, ef, eg, eh) → new_rangeSize116(zx81, zx82, zx83, zx84, ee, ef)
new_range17(zx300, zx310, ty_Char) → new_range9(zx300, zx310)
new_primIntToChar(Neg(Succ(zx30000))) → error([])
new_index813(zx30, zx31, zx129) → new_index82(zx30, zx31, zx129)
new_psPs2(:(zx1260, zx1261), zx89, bba, bbb) → :(zx1260, new_psPs2(zx1261, zx89, bba, bbb))
new_index821(zx30, zx31, Neg(Zero), Pos(Succ(zx12900))) → new_index818(zx30, zx31)
new_index820(zx30, zx31, Zero, zx17600) → new_index818(zx30, zx31)
new_index821(zx30, zx31, Neg(Zero), Neg(Succ(zx12900))) → new_index819(zx30, zx31, zx12900, Zero)
new_range17(zx300, zx310, app(app(ty_@2, gg), gh)) → new_range21(zx300, zx310, gg, gh)
new_index58(zx657, zx658, Succ(zx6590), Succ(zx6600)) → new_index58(zx657, zx658, zx6590, zx6600)
new_range18(zx300, zx310, app(app(app(ty_@3, bad), bae), baf)) → new_range20(zx300, zx310, bad, bae, baf)
new_primMulNat0(Zero, zx16000) → Zero
new_rangeSize114(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, ee, ef, eg, eh) → new_rangeSize115(zx81, zx82, zx83, zx84, ee, ef)
new_index510(Integer(Pos(Zero)), Integer(Neg(Zero))) → new_fromInteger(new_primMinusInt(Neg(Zero), Pos(Zero)))
new_index510(Integer(Neg(Zero)), Integer(Pos(Zero))) → new_fromInteger(new_primMinusInt(Pos(Zero), Neg(Zero)))
new_rangeSize20(zx137, zx138, app(app(ty_@2, dc), dd)) → new_rangeSize4(@2(zx137, zx138), dc, dd)
new_primPlusInt25(zx158, zx1590, zx1600) → Neg(new_primPlusNat2(zx158, zx1590, zx1600))
new_index81(zx30, zx31, zx129) → new_index82(zx30, zx31, zx129)
new_index1(zx81, zx83, ty_Char) → new_index10(zx81, zx83)
new_rangeSize7(@2(Integer(Neg(Succ(zx30000))), Integer(Pos(zx3100)))) → new_ps7(new_index510(Integer(Neg(Succ(zx30000))), Integer(Pos(zx3100))))
new_index1214(Neg(Zero), Pos(Succ(zx6700))) → new_index129(zx6700, Succ(zx6700))
new_rangeSize21(@2(Pos(Succ(zx3000)), Neg(zx310))) → Pos(Zero)
new_range1(zx400, zx410, ty_Bool) → new_range12(zx400, zx410)
new_dsEm4(zx455, zx3610, zx3611) → new_enforceWHNF5(new_primPlusInt18(zx455, zx3610), new_primPlusInt18(zx455, zx3610), zx3611)
new_primPlusInt20(zx158, Succ(zx15900), Zero) → new_primMinusNat1(zx158)
new_primPlusInt20(zx158, Zero, Succ(zx16000)) → new_primMinusNat1(zx158)
new_index6(@2(zx640, zx641), @2(zx670, zx671), ce, cf) → new_ps3(zx641, zx671, zx640, zx670, cf, ce)
new_takeWhile113(zx435, zx436, zx437, Succ(zx4380), Zero) → []
new_range19(zx26, zx28, app(app(app(ty_@3, bbc), bbd), bbe)) → new_range20(zx26, zx28, bbc, bbd, bbe)
new_takeWhile19(zx444, zx445, Succ(zx4460), Zero) → []
new_index128(zx631, zx632, Succ(zx6330), Succ(zx6340)) → new_index128(zx631, zx632, zx6330, zx6340)
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Succ(zx300000)))) → :(Integer(Neg(Succ(zx300000))), new_takeWhile20(new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000)))))
new_sum1([]) → new_foldl'
new_index511(zx652, zx653, Zero, Zero) → new_index512(zx652, zx653)
new_takeWhile22(zx173, zx172) → new_takeWhile7(Neg(Zero), zx172)
new_range12(False, False) → :(False, new_foldr12)
new_index88(zx30, zx31, Zero, zx13000, zx129) → new_index81(zx30, zx31, zx129)
new_enforceWHNF8(zx678, zx677, :(zx36410, zx36411)) → new_dsEm12(new_primPlusInt(zx677, zx36410), zx36411)
new_enforceWHNF6(zx672, zx671, :(zx36210, zx36211)) → new_dsEm6(new_primPlusInt15(zx671, zx36210), zx36211)
new_primPlusInt15(Pos(zx4560), GT) → new_primPlusInt9(zx4560)
new_fromInteger(zx450) → zx450
new_range11(GT, LT) → new_foldr7
new_index821(zx30, zx31, Pos(Zero), Neg(Zero)) → new_index814(zx30, zx31)
new_index821(zx30, zx31, Neg(Zero), Pos(Zero)) → new_index814(zx30, zx31)
new_index818(zx30, zx31) → new_index815(zx30, zx31)
new_primPlusInt23(Succ(zx1510), Succ(zx15200), Zero) → new_primMinusNat4(zx1510)
new_primPlusInt23(Succ(zx1510), Zero, Succ(zx15300)) → new_primMinusNat4(zx1510)
new_primMinusNat2(Succ(zx2130), zx16000, Succ(zx1580)) → new_primMinusNat3(new_primPlusNat0(zx2130, zx16000), zx1580)
new_range22(zx3000, zx3100, ty_@0) → new_range4(zx3000, zx3100)
new_index89(zx30, zx31) → new_index810(zx30, zx31)
new_takeWhile8(Integer(Neg(Zero)), Integer(Pos(Zero))) → :(Integer(Pos(Zero)), new_takeWhile20(new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))))
new_takeWhile8(Integer(Neg(Succ(zx310000))), Integer(Neg(Zero))) → []
new_range18(zx300, zx310, ty_Integer) → new_range8(zx300, zx310)
new_rangeSize119(zx62, zx63, zx64, zx65, zx66, zx67, :(zx900, zx901), zx70, be, bf, bg, bh, ca) → new_rangeSize113(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg)
new_rangeSize21(@2(Neg(Zero), Neg(Zero))) → new_ps7(new_index1216(Neg(Zero), Neg(Zero)))
new_rangeSize6(@2(EQ, LT)) → Pos(Zero)
new_ps7(zx127) → new_primPlusInt13(zx127)
new_primPlusInt4(zx4590) → new_primPlusInt0(zx4590)
new_primPlusInt3(zx4590) → new_primPlusInt5(zx4590)
new_sum([]) → new_foldl'
new_index58(zx657, zx658, Succ(zx6590), Zero) → new_error
new_index821(zx30, zx31, Pos(Zero), Neg(Succ(zx12900))) → new_index89(zx30, zx31)
new_rangeSize6(@2(LT, GT)) → new_ps7(new_index13(LT, GT))
new_index60(zx64, zx67) → new_index510(zx64, zx67)
new_index510(Integer(Neg(Succ(zx64000))), Integer(Pos(Succ(zx67000)))) → new_index515(zx64000, zx67000, Succ(zx67000))
new_rangeSize21(@2(Neg(Zero), Neg(Succ(zx3100)))) → Pos(Zero)
new_range19(zx26, zx28, ty_Char) → new_range9(zx26, zx28)
new_range2(zx40, zx41, ty_Ordering) → new_range11(zx40, zx41)
new_index87(zx30, zx31, Neg(Zero), zx129) → new_index813(zx30, zx31, zx129)
new_index126(zx631, zx632) → new_index127(zx631, zx632, Succ(zx632))
new_range17(zx300, zx310, ty_@0) → new_range4(zx300, zx310)
new_range12(False, True) → :(False, :(True, new_foldr12))
new_rangeSize21(@2(Neg(Succ(zx3000)), Neg(Zero))) → new_ps7(new_index1217(Neg(Succ(zx3000)), Neg(Zero)))
new_rangeSize110(zx25, zx26, zx27, zx28, [], eb, ec, ed) → new_rangeSize116(zx25, zx26, zx27, zx28, eb, ec)
new_primPlusInt14(Neg(zx4600), False) → new_primPlusInt13(Neg(zx4600))
new_index816(zx30, zx31, Zero, Succ(zx161000), zx129) → new_index81(zx30, zx31, zx129)
new_range19(zx26, zx28, ty_Bool) → new_range12(zx26, zx28)
new_range5(zx102, zx103, app(app(ty_@2, bfg), bfh)) → new_range7(zx102, zx103, bfg, bfh)
new_index13(LT, GT) → new_sum1(new_range11(LT, GT))
new_ps0 → new_primPlusInt13(Pos(Zero))
new_range22(zx3000, zx3100, app(app(app(ty_@3, bdb), bdc), bdd)) → new_range20(zx3000, zx3100, bdb, bdc, bdd)
new_range22(zx3000, zx3100, ty_Integer) → new_range8(zx3000, zx3100)
new_takeWhile7(Pos(Zero), Pos(Zero)) → :(Pos(Zero), new_takeWhile21(Zero, new_ps0, new_ps0))
new_foldr12 → []
new_primPlusInt18(Pos(zx4550), EQ) → new_primPlusInt9(zx4550)
new_rangeSize110(zx25, zx26, zx27, zx28, :(zx290, zx291), eb, ec, ed) → new_rangeSize114(zx25, zx26, zx27, zx28, new_foldr9(zx290, new_range19(zx26, zx28, ec), ed, ec), new_foldr11(zx26, zx28, zx291, ed, ec), eb, ec, ed, ec)
new_index128(zx631, zx632, Zero, Succ(zx6340)) → new_index126(zx631, zx632)
new_index0(zx82, zx84, ty_Int) → new_index11(zx82, zx84)
new_rangeSize21(@2(Pos(Zero), Neg(Zero))) → new_ps7(new_index1216(Pos(Zero), Neg(Zero)))
new_rangeSize21(@2(Neg(Zero), Pos(Zero))) → new_ps7(new_index1216(Neg(Zero), Pos(Zero)))
new_index14(False, True) → new_sum2(new_range12(False, True))
new_rangeSize16(zx12, zx13, zx14, zx15, zx16, zx17, [], ba, bb, bc, bd) → new_rangeSize120(zx12, zx13, zx14, zx15, zx16, zx17, ba, bb, bc)
new_primPlusNat0(Zero, Zero) → Zero
new_index1211(zx626, zx627) → new_index1212(zx626, zx627, Succ(zx627))
new_primPlusInt15(Pos(zx4560), LT) → new_primPlusInt17(zx4560)
new_primPlusInt13(Pos(zx1270)) → Pos(new_primPlusNat1(zx1270, Zero))
new_index(zx64, zx67, ty_@0) → new_index9(zx64, zx67)
new_index7(zx64, zx67) → new_index60(zx64, zx67)
new_index1(zx81, zx83, app(app(ty_@2, gb), gc)) → new_index6(zx81, zx83, gb, gc)
new_primPlusInt21(zx151, zx1520, zx1530) → Pos(new_primPlusNat2(zx151, zx1520, zx1530))
new_primPlusInt(Pos(zx4590), False) → new_primPlusInt2(zx4590)
new_range1(zx400, zx410, app(app(ty_@2, hg), hh)) → new_range7(zx400, zx410, hg, hh)
new_rangeSize6(@2(GT, LT)) → Pos(Zero)
new_psPs1(:(zx1050, zx1051), zx88, bbh, bca, bcb) → :(zx1050, new_psPs1(zx1051, zx88, bbh, bca, bcb))
new_range1(zx400, zx410, ty_Ordering) → new_range11(zx400, zx410)
new_index85(zx30, zx31, Pos(Succ(zx16200)), zx129) → new_index88(zx30, zx31, Zero, zx16200, zx129)
new_index58(zx657, zx658, Zero, Zero) → new_index59(zx657, zx658)
new_ms(zx238, zx237) → new_primMinusInt(zx238, zx237)
new_range2(zx40, zx41, ty_@0) → new_range4(zx40, zx41)
new_rangeSize21(@2(Neg(Succ(zx3000)), Pos(zx310))) → new_ps7(new_index1214(Neg(Succ(zx3000)), Pos(zx310)))
new_range1(zx400, zx410, app(app(app(ty_@3, hd), he), hf)) → new_range6(zx400, zx410, hd, he, hf)
new_takeWhile17(zx487, zx488, Zero, Zero) → new_takeWhile18(zx487, zx488)
new_primPlusNat1(Succ(zx2450), zx15300) → Succ(Succ(new_primPlusNat0(zx2450, zx15300)))
new_index1214(Neg(Succ(zx6400)), Pos(Succ(zx6700))) → new_index1215(zx6400, zx6700, Succ(zx6700))
new_rangeSize9(zx137, zx138, ty_Ordering) → new_rangeSize6(@2(zx137, zx138))
new_takeWhile8(Integer(Pos(Succ(zx310000))), Integer(Pos(Zero))) → :(Integer(Pos(Zero)), new_takeWhile9(Succ(zx310000), new_primPlusInt13(Pos(Zero)), new_primPlusInt13(Pos(Zero))))
new_index56(zx708, zx709, Zero) → new_fromInteger(new_primMinusInt(Neg(Succ(zx709)), Neg(Succ(zx708))))
new_index515(zx531, zx532, Succ(zx5330)) → new_index515(zx531, zx532, zx5330)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Neg(Zero)))) → new_ps7(new_index60(Integer(Pos(Zero)), Integer(Neg(Zero))))
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Pos(Zero)))) → new_ps7(new_index60(Integer(Neg(Zero)), Integer(Pos(Zero))))
new_fromEnum(Char(zx3000)) → Pos(zx3000)
new_range5(zx102, zx103, app(app(app(ty_@3, bfd), bfe), bff)) → new_range6(zx102, zx103, bfd, bfe, bff)
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Pos(Zero)))) → new_ps7(new_index60(Integer(Pos(Zero)), Integer(Pos(Zero))))
new_index4(@3(zx640, zx641, zx642), @3(zx670, zx671, zx672), cb, cc, cd) → new_ps6(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
new_primPlusInt15(Pos(zx4560), EQ) → new_primPlusInt17(zx4560)
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Zero))) → :(Integer(Neg(Zero)), new_takeWhile20(new_primPlusInt13(Neg(Zero)), new_primPlusInt13(Neg(Zero))))
new_primPlusInt20(zx158, Succ(zx15900), Succ(zx16000)) → new_primMinusNat2(new_primMulNat0(zx15900, zx16000), zx16000, zx158)
new_takeWhile19(zx444, zx445, Zero, Zero) → new_takeWhile112(zx444, zx445)
new_range23(zx3000, zx3100, ty_Bool) → new_range12(zx3000, zx3100)
new_index0(zx82, zx84, app(app(app(ty_@3, fa), fb), fc)) → new_index4(zx82, zx84, fa, fb, fc)
new_primMinusNat3(zx16000, Succ(zx1580)) → new_primMinusNat0(zx16000, zx1580)
new_rangeSize115(zx81, zx82, zx83, zx84, ee, ef) → new_ps7(new_ps3(zx82, zx84, zx81, zx83, ef, ee))
new_takeWhile110(zx429, zx430, zx431, Zero, Zero) → new_takeWhile111(zx429, zx430, zx431)
new_takeWhile110(zx429, zx430, zx431, Zero, Succ(zx4330)) → new_takeWhile111(zx429, zx430, zx431)
new_foldr6(bbh, bca, bcb) → []
new_rangeSize118(zx291, zx292, :(zx2930, zx2931)) → new_ps7(new_index11(Pos(Succ(zx291)), Pos(Succ(zx292))))
new_range16(zx13, zx16, ty_Integer) → new_range8(zx13, zx16)
new_rangeSize119(zx62, zx63, zx64, zx65, zx66, zx67, [], [], be, bf, bg, bh, ca) → new_rangeSize120(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg)
new_index13(GT, EQ) → new_error
new_range22(zx3000, zx3100, ty_Int) → new_range10(zx3000, zx3100)
new_range23(zx3000, zx3100, ty_@0) → new_range4(zx3000, zx3100)
new_index817(zx30, zx31, Succ(zx176000), Zero) → new_index89(zx30, zx31)
new_rangeSize111(zx385, zx386, Zero, Zero) → new_rangeSize112(zx385, zx386)
new_index816(zx30, zx31, Succ(zx130000), Zero, zx129) → new_index812(zx30, zx31, zx129)
new_takeWhile23(zx487, zx520, zx519) → new_takeWhile8(Integer(Neg(Succ(zx487))), Integer(zx519))
new_index1214(Neg(Zero), Pos(Zero)) → new_ms(Pos(Zero), Neg(Zero))
new_index1214(Pos(Zero), Neg(Zero)) → new_ms(Neg(Zero), Pos(Zero))
new_index510(Integer(Neg(Zero)), Integer(Pos(Succ(zx67000)))) → new_index513(zx67000, Succ(zx67000))
new_range19(zx26, zx28, ty_@0) → new_range4(zx26, zx28)
new_ps2 → new_primPlusInt13(Neg(Zero))
new_primPlusInt24(zx158, Pos(zx1590), Pos(zx1600)) → new_primPlusInt20(zx158, zx1590, zx1600)
new_index127(zx704, zx705, Zero) → new_ms(Neg(Succ(zx705)), Neg(Succ(zx704)))
new_primPlusInt13(Neg(Succ(zx12700))) → new_primMinusNat1(zx12700)
new_foldr9(zx109, [], bgf, bgg) → new_foldr10(bgf, bgg)
new_index1216(zx64, zx67) → new_index1214(zx64, zx67)
new_index1215(zx504, zx505, Succ(zx5060)) → new_index1215(zx504, zx505, zx5060)
new_primPlusInt15(Neg(zx4560), GT) → new_primPlusInt8(zx4560)
new_range5(zx102, zx103, ty_Int) → new_range10(zx102, zx103)
new_primMinusInt(Neg(zx2380), Pos(zx2370)) → Neg(new_primPlusNat0(zx2380, zx2370))
new_takeWhile7(Pos(Succ(zx31000)), Pos(Zero)) → :(Pos(Zero), new_takeWhile21(Succ(zx31000), new_ps0, new_ps0))
new_primPlusInt6(Pos(zx4740), GT) → new_primPlusInt10(zx4740)
new_range3(zx400, zx410, app(app(app(ty_@3, bce), bcf), bcg)) → new_range6(zx400, zx410, bce, bcf, bcg)
new_primPlusInt15(Neg(zx4560), LT) → new_primPlusInt16(zx4560)
new_rangeSize7(@2(Integer(Pos(Succ(zx30000))), Integer(Pos(Succ(zx31000))))) → new_rangeSize19(zx30000, zx31000, new_takeWhile19(zx31000, zx30000, zx30000, zx31000))
new_rangeSize7(@2(Integer(Neg(Succ(zx30000))), Integer(Neg(Succ(zx31000))))) → new_rangeSize111(zx30000, zx31000, zx31000, zx30000)
new_primPlusNat2(Zero, Zero, Zero) → new_primPlusNat5(Zero)
new_sum1(:(zx3620, zx3621)) → new_dsEm7(new_fromInt, zx3620, zx3621)
new_rangeSize21(@2(Pos(Zero), Pos(Succ(zx3100)))) → new_ps7(new_index1216(Pos(Zero), Pos(Succ(zx3100))))
new_primPlusInt10(zx4740) → new_primPlusInt12(zx4740)
new_index(zx64, zx67, ty_Char) → new_index10(zx64, zx67)
new_takeWhile8(Integer(Neg(zx31000)), Integer(Pos(Succ(zx300000)))) → []
new_foldr11(zx47, zx48, [], bba, bbb) → new_foldr10(bba, bbb)
new_range2(zx40, zx41, ty_Int) → new_range10(zx40, zx41)
new_primPlusInt18(Neg(zx4550), LT) → new_primPlusInt16(zx4550)
new_index513(zx568, Succ(zx5690)) → new_index513(zx568, zx5690)
new_rangeSize116(zx25, zx26, zx27, zx28, eb, ec) → Pos(Zero)
new_index1214(Pos(Succ(zx6400)), Pos(Succ(zx6700))) → new_index1210(zx6400, zx6700, zx6400, zx6700)
new_rangeSize20(zx137, zx138, ty_Bool) → new_rangeSize5(@2(zx137, zx138))
new_rangeSize21(@2(Pos(Zero), Neg(Succ(zx3100)))) → Pos(Zero)
new_enforceWHNF8(zx678, zx677, []) → new_foldl'0(zx677)
new_primPlusInt23(Zero, Zero, Zero) → new_primMinusNat1(Zero)
new_range23(zx3000, zx3100, app(app(app(ty_@3, bed), bee), bef)) → new_range20(zx3000, zx3100, bed, bee, bef)
new_index87(zx30, zx31, Pos(Zero), zx129) → new_index813(zx30, zx31, zx129)
new_primPlusNat2(Succ(zx1510), Succ(zx15200), Zero) → new_primPlusNat5(Succ(zx1510))
new_primPlusNat2(Succ(zx1510), Zero, Succ(zx15300)) → new_primPlusNat5(Succ(zx1510))
new_primPlusInt17(zx4550) → new_primPlusInt13(Pos(zx4550))
new_index86(zx30, zx31, zx13000, Neg(zx1630), zx129) → new_index88(zx30, zx31, zx1630, zx13000, zx129)
new_foldr5(zx144, zx145, :(zx1460, zx1461), baa, bab, bac) → new_psPs1(:(@3(zx144, zx145, zx1460), []), new_foldr5(zx144, zx145, zx1461, baa, bab, bac), baa, bab, bac)
new_primPlusInt11(zx4740) → new_primPlusInt7(zx4740)
new_rangeSize6(@2(EQ, EQ)) → new_ps7(new_index13(EQ, EQ))
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Neg(Succ(zx31000))))) → Pos(Zero)
new_takeWhile7(Pos(Succ(zx31000)), Pos(Succ(zx30000))) → new_takeWhile110(zx31000, zx30000, new_ps(zx30000), zx30000, zx31000)
new_index814(zx30, zx31) → new_index815(zx30, zx31)
new_takeWhile18(zx487, zx488) → :(Integer(Neg(Succ(zx488))), new_takeWhile23(zx487, new_primPlusInt13(Neg(Succ(zx488))), new_primPlusInt13(Neg(Succ(zx488)))))
new_index1210(zx626, zx627, Succ(zx6280), Succ(zx6290)) → new_index1210(zx626, zx627, zx6280, zx6290)
new_index821(zx30, zx31, Pos(Succ(zx17600)), Neg(zx1290)) → new_index89(zx30, zx31)
new_index58(zx657, zx658, Zero, Succ(zx6600)) → new_index59(zx657, zx658)
new_primIntToChar(Pos(zx3000)) → Char(zx3000)
new_range13(zx47, zx48, ty_Char) → new_range9(zx47, zx48)
new_primMinusInt(Neg(zx2380), Neg(zx2370)) → new_primMinusNat0(zx2370, zx2380)
new_range2(zx40, zx41, app(app(app(ty_@3, ha), hb), hc)) → new_range6(zx40, zx41, ha, hb, hc)
new_foldr10(bba, bbb) → []
new_index514(zx692, zx693, Succ(zx6940)) → new_index514(zx692, zx693, zx6940)
new_range9(zx300, zx310) → new_map0(new_enumFromTo(new_fromEnum(zx300), new_fromEnum(zx310)))
new_range6(@3(zx400, zx401, zx402), @3(zx410, zx411, zx412), ha, hb, hc) → new_foldr8(zx402, zx412, zx401, zx411, new_range1(zx400, zx410, ha), ha, hb, hc)
new_range16(zx13, zx16, app(app(app(ty_@3, bga), bgb), bgc)) → new_range20(zx13, zx16, bga, bgb, bgc)
new_rangeSize7(@2(Integer(Pos(Succ(zx30000))), Integer(Pos(Zero)))) → Pos(Zero)
new_takeWhile17(zx487, zx488, Succ(zx4890), Succ(zx4900)) → new_takeWhile17(zx487, zx488, zx4890, zx4900)
new_sum3(:(zx3640, zx3641)) → new_dsEm10(new_fromInt, zx3640, zx3641)
new_primMinusNat0(Zero, Succ(zx15800)) → Neg(Succ(zx15800))
new_primMinusNat5(zx1510, Succ(zx2320), zx15300) → new_primMinusNat3(zx1510, Succ(Succ(new_primPlusNat0(zx2320, zx15300))))
new_range2(zx40, zx41, ty_Bool) → new_range12(zx40, zx41)
new_primPlusInt2(zx4590) → new_primPlusInt3(zx4590)
new_takeWhile8(Integer(Neg(Succ(zx310000))), Integer(Pos(Zero))) → []
new_range3(zx400, zx410, ty_Integer) → new_range8(zx400, zx410)
new_takeWhile7(Pos(Succ(zx31000)), Neg(Zero)) → :(Neg(Zero), new_takeWhile21(Succ(zx31000), new_ps2, new_ps2))
new_rangeSize120(zx12, zx13, zx14, zx15, zx16, zx17, ba, bb, bc) → Pos(Zero)
new_rangeSize5(@2(False, True)) → new_ps7(new_index14(False, True))
new_takeWhile8(Integer(Pos(zx31000)), Integer(Neg(Succ(zx300000)))) → :(Integer(Neg(Succ(zx300000))), new_takeWhile9(zx31000, new_primPlusInt13(Neg(Succ(zx300000))), new_primPlusInt13(Neg(Succ(zx300000)))))
new_index84(zx30, zx31, zx13000, Pos(zx1610), zx129) → new_index811(zx30, zx31, zx13000, zx1610, zx129)
new_dsEm11(zx676, zx36111) → new_enforceWHNF5(zx676, zx676, zx36111)
new_range23(zx3000, zx3100, ty_Ordering) → new_range11(zx3000, zx3100)
new_primPlusInt20(zx158, Zero, Zero) → new_primMinusNat1(zx158)
new_psPs3 → new_foldr7
new_index816(zx30, zx31, Zero, Zero, zx129) → new_index813(zx30, zx31, zx129)
new_range3(zx400, zx410, app(app(ty_@2, bch), bda)) → new_range7(zx400, zx410, bch, bda)
new_rangeSize5(@2(True, False)) → Pos(Zero)
new_rangeSize9(zx137, zx138, ty_Bool) → new_rangeSize5(@2(zx137, zx138))
new_primPlusInt0(zx4590) → new_primPlusInt1(zx4590)
new_index821(zx30, zx31, Pos(Zero), Pos(Succ(zx12900))) → new_index820(zx30, zx31, Zero, zx12900)
new_primPlusInt14(Neg(zx4600), True) → new_primPlusInt4(zx4600)
new_index821(zx30, zx31, Neg(Succ(zx17600)), Pos(zx1290)) → new_index818(zx30, zx31)
new_rangeSize117(zx30, zx31, :(zx310, zx311)) → new_ps7(new_index10(zx30, zx31))
new_index816(zx30, zx31, Succ(zx130000), Succ(zx161000), zx129) → new_index816(zx30, zx31, zx130000, zx161000, zx129)
new_range16(zx13, zx16, ty_Ordering) → new_range11(zx13, zx16)
new_range5(zx102, zx103, ty_Integer) → new_range8(zx102, zx103)
new_enumFromTo(zx300, zx310) → new_takeWhile7(zx310, zx300)
new_primPlusNat4(Zero, zx15300) → new_primPlusNat0(Zero, Succ(zx15300))
new_primMinusInt(Pos(zx2380), Neg(zx2370)) → Pos(new_primPlusNat0(zx2380, zx2370))
new_sum3([]) → new_foldl'
new_rangeSize6(@2(GT, GT)) → new_ps7(new_index13(GT, GT))
new_index(zx64, zx67, ty_Int) → new_index11(zx64, zx67)
new_rangeSize9(zx137, zx138, ty_@0) → new_rangeSize3(@2(zx137, zx138))
new_range2(zx40, zx41, app(app(ty_@2, bcc), bcd)) → new_range7(zx40, zx41, bcc, bcd)
new_rangeSize21(@2(Pos(Succ(zx3000)), Pos(Succ(zx3100)))) → new_rangeSize118(zx3000, zx3100, new_takeWhile110(zx3100, zx3000, new_ps(zx3000), zx3000, zx3100))
new_range3(zx400, zx410, ty_Char) → new_range9(zx400, zx410)
new_primPlusInt(Neg(zx4590), True) → new_primPlusInt0(zx4590)
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Succ(zx300000)))) → []
new_enforceWHNF7(zx664, zx663, []) → new_foldl'0(zx663)
new_rangeSize18(:(zx7110, zx7111)) → new_ps7(new_index13(GT, EQ))
new_index13(GT, GT) → new_sum1(new_range11(GT, GT))
new_enforceWHNF5(zx668, zx667, :(zx36110, zx36111)) → new_dsEm11(new_primPlusInt18(zx667, zx36110), zx36111)
new_index1214(Pos(Zero), Pos(Zero)) → new_ms(Pos(Zero), Pos(Zero))
new_rangeSize3(@2(@0, @0)) → new_ps7(Pos(Zero))
new_primPlusNat0(Succ(zx24500), Succ(zx153000)) → Succ(Succ(new_primPlusNat0(zx24500, zx153000)))
new_range3(zx400, zx410, ty_Int) → new_range10(zx400, zx410)
new_range1(zx400, zx410, ty_@0) → new_range4(zx400, zx410)
new_range22(zx3000, zx3100, ty_Char) → new_range9(zx3000, zx3100)
new_ps1(zx30000) → new_primPlusInt13(Neg(Succ(zx30000)))
new_range16(zx13, zx16, ty_Int) → new_range10(zx13, zx16)
new_index1210(zx626, zx627, Zero, Zero) → new_index1211(zx626, zx627)
new_rangeSize5(@2(True, True)) → new_ps7(new_index14(True, True))
new_rangeSize6(@2(LT, EQ)) → new_ps7(new_index13(LT, EQ))
new_primPlusInt26(Neg(zx1360), zx137, zx138, zx139, bgh) → new_primPlusInt24(zx1360, new_rangeSize20(zx137, zx138, bgh), zx139)
new_primPlusInt6(Pos(zx4740), LT) → new_primPlusInt9(zx4740)
new_index815(zx30, zx31) → new_ms(new_fromEnum(zx31), new_fromEnum(zx30))
new_index1214(Pos(Zero), Pos(Succ(zx6700))) → new_index1213(zx6700, Succ(zx6700))
new_dsEm7(zx456, zx3620, zx3621) → new_enforceWHNF6(new_primPlusInt15(zx456, zx3620), new_primPlusInt15(zx456, zx3620), zx3621)
new_range16(zx13, zx16, ty_Char) → new_range9(zx13, zx16)
new_primPlusInt18(Pos(zx4550), LT) → new_primPlusInt17(zx4550)
new_takeWhile113(zx435, zx436, zx437, Zero, Succ(zx4390)) → new_takeWhile114(zx435, zx436, zx437)
new_primPlusInt13(Neg(Zero)) → Pos(Succ(Zero))
new_dsEm6(zx679, zx36211) → new_enforceWHNF6(zx679, zx679, zx36211)
new_index1212(zx700, zx701, Zero) → new_ms(Pos(Succ(zx701)), Pos(Succ(zx700)))
new_index83(zx30, zx31, Pos(Succ(zx13000)), zx129) → new_index84(zx30, zx31, zx13000, new_fromEnum(zx31), zx129)
new_dsEm9(zx460, zx3780, zx3781) → new_enforceWHNF4(new_primPlusInt14(zx460, zx3780), new_primPlusInt14(zx460, zx3780), zx3781)
new_index13(LT, EQ) → new_sum(new_range11(LT, EQ))
new_primPlusInt23(Succ(zx1510), Succ(zx15200), Succ(zx15300)) → new_primMinusNat5(zx1510, new_primMulNat0(zx15200, zx15300), zx15300)
new_range8(zx300, zx310) → new_takeWhile8(zx310, zx300)
new_primPlusNat2(Zero, Succ(zx15200), Succ(zx15300)) → new_primPlusNat4(new_primMulNat0(zx15200, zx15300), zx15300)
new_primPlusInt16(zx4550) → new_primPlusInt13(Neg(zx4550))
new_index1214(Neg(Zero), Neg(Succ(zx6700))) → new_error
new_sum2(:(zx3780, zx3781)) → new_dsEm9(new_fromInt, zx3780, zx3781)
new_rangeSize9(zx137, zx138, ty_Integer) → new_rangeSize7(@2(zx137, zx138))
new_index819(zx30, zx31, zx17600, Zero) → new_index89(zx30, zx31)
new_index13(GT, LT) → new_error
new_takeWhile7(Neg(Succ(zx31000)), Neg(Succ(zx30000))) → new_takeWhile113(zx31000, zx30000, new_ps1(zx30000), zx31000, zx30000)
new_error → error([])
new_index(zx64, zx67, ty_Ordering) → new_index13(zx64, zx67)
new_primPlusInt22(zx151, Neg(zx1520), Neg(zx1530)) → new_primPlusInt21(zx151, zx1520, zx1530)
new_foldr8(zx38, zx39, zx40, zx41, [], bbh, bca, bcb) → new_foldr6(bbh, bca, bcb)
new_rangeSize113(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg) → new_ps7(new_ps6(zx64, zx67, zx63, zx66, zx62, zx65, bg, bf, be))
new_rangeSize18([]) → Pos(Zero)
new_foldl'0(zx663) → zx663
new_sum(:(zx3610, zx3611)) → new_dsEm4(new_fromInt, zx3610, zx3611)
new_index85(zx30, zx31, Pos(Zero), zx129) → new_index813(zx30, zx31, zx129)
new_index1214(Pos(Succ(zx6400)), Pos(Zero)) → new_error
new_primPlusInt23(Zero, Succ(zx15200), Succ(zx15300)) → new_primMinusNat1(new_primPlusNat1(new_primMulNat0(zx15200, zx15300), zx15300))
new_primPlusInt12(zx4740) → new_primPlusInt5(zx4740)
new_rangeSize4(@2(@2(zx300, zx301), @2(zx310, zx311)), dh, ea) → new_rangeSize110(zx300, zx301, zx310, zx311, new_range18(zx300, zx310, dh), dh, ea, dh)
new_range19(zx26, zx28, ty_Integer) → new_range8(zx26, zx28)
new_index511(zx652, zx653, Zero, Succ(zx6550)) → new_index512(zx652, zx653)
new_range18(zx300, zx310, ty_Int) → new_range10(zx300, zx310)
new_index1(zx81, zx83, ty_Int) → new_index11(zx81, zx83)
new_primMinusNat1(Succ(zx127000)) → Neg(Succ(zx127000))
new_index821(zx30, zx31, Pos(Succ(zx17600)), Pos(zx1290)) → new_index819(zx30, zx31, zx17600, zx1290)
new_primMinusNat4(zx1510) → Pos(Succ(zx1510))
new_primPlusInt18(Pos(zx4550), GT) → new_primPlusInt10(zx4550)
new_index(zx64, zx67, app(app(app(ty_@3, cb), cc), cd)) → new_index4(zx64, zx67, cb, cc, cd)
new_primPlusNat3(zx1510, Zero, zx15300) → new_primPlusNat1(Succ(zx1510), zx15300)
new_range22(zx3000, zx3100, ty_Ordering) → new_range11(zx3000, zx3100)
new_index59(zx657, zx658) → new_index56(zx657, zx658, Succ(zx658))
new_index13(EQ, GT) → new_sum1(new_range11(EQ, GT))
new_index85(zx30, zx31, Neg(Succ(zx16200)), zx129) → new_index812(zx30, zx31, zx129)
new_enforceWHNF7(zx664, zx663, :(zx36010, zx36011)) → new_dsEm8(new_primPlusInt6(zx663, zx36010), zx36011)
new_fromInt → Pos(Zero)
new_index85(zx30, zx31, Neg(Zero), zx129) → new_index813(zx30, zx31, zx129)
new_range11(EQ, LT) → new_foldr7
new_primMinusNat0(Succ(zx160000), Succ(zx15800)) → new_primMinusNat0(zx160000, zx15800)

The set Q consists of the following terms:

new_range22(x0, x1, ty_Char)
new_primPlusInt2(x0)
new_foldr10(x0, x1)
new_rangeSize20(x0, x1, ty_Int)
new_index(x0, x1, ty_Integer)
new_foldr12
new_range22(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_rangeSize118(x0, x1, :(x2, x3))
new_index81(x0, x1, x2)
new_sum([])
new_primPlusInt15(Pos(x0), EQ)
new_psPs1([], x0, x1, x2, x3)
new_rangeSize9(x0, x1, ty_Integer)
new_primMinusNat0(Zero, Zero)
new_index(x0, x1, ty_@0)
new_index1(x0, x1, ty_Char)
new_rangeSize17(x0, x1, :(x2, x3))
new_index13(EQ, EQ)
new_takeWhile8(Integer(Pos(x0)), Integer(Neg(Succ(x1))))
new_takeWhile8(Integer(Neg(x0)), Integer(Pos(Succ(x1))))
new_index1(x0, x1, app(app(ty_@2, x2), x3))
new_index1213(x0, Succ(x1))
new_range1(x0, x1, ty_Integer)
new_takeWhile110(x0, x1, x2, Zero, Succ(x3))
new_index1210(x0, x1, Succ(x2), Zero)
new_range17(x0, x1, app(app(ty_@2, x2), x3))
new_takeWhile23(x0, x1, x2)
new_rangeSize9(x0, x1, ty_Bool)
new_rangeSize17(x0, x1, [])
new_index818(x0, x1)
new_takeWhile7(Pos(Succ(x0)), Neg(Zero))
new_takeWhile7(Neg(Succ(x0)), Pos(Zero))
new_primPlusInt7(x0)
new_index128(x0, x1, Zero, Succ(x2))
new_rangeSize21(@2(Pos(Succ(x0)), Pos(Succ(x1))))
new_primPlusInt22(x0, Neg(x1), Neg(x2))
new_range11(GT, GT)
new_rangeSize111(x0, x1, Succ(x2), Zero)
new_primPlusInt20(x0, Zero, Zero)
new_primPlusInt3(x0)
new_index513(x0, Zero)
new_primPlusInt20(x0, Succ(x1), Zero)
new_range11(GT, EQ)
new_range11(EQ, GT)
new_range1(x0, x1, ty_Bool)
new_range11(EQ, LT)
new_range11(LT, EQ)
new_range18(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_range12(True, False)
new_range12(False, True)
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Neg(Succ(x0)))))
new_index58(x0, x1, Succ(x2), Zero)
new_primPlusInt13(Pos(x0))
new_range19(x0, x1, ty_@0)
new_index820(x0, x1, Zero, x2)
new_range1(x0, x1, app(app(ty_@2, x2), x3))
new_sum0([])
new_index0(x0, x1, ty_Integer)
new_index0(x0, x1, ty_Bool)
new_primPlusInt5(x0)
new_rangeSize7(@2(Integer(Neg(Succ(x0))), Integer(Neg(Zero))))
new_sum2([])
new_primPlusInt11(x0)
new_primPlusInt4(x0)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt17(x0)
new_index510(Integer(Pos(Zero)), Integer(Pos(Succ(x0))))
new_rangeSize16(x0, x1, x2, x3, x4, x5, :(x6, x7), x8, x9, x10, x11)
new_range16(x0, x1, ty_Ordering)
new_range23(x0, x1, app(app(ty_@2, x2), x3))
new_range4(@0, @0)
new_range17(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_rangeSize19(x0, x1, :(x2, x3))
new_range22(x0, x1, app(app(ty_@2, x2), x3))
new_index1216(x0, x1)
new_index511(x0, x1, Zero, Zero)
new_foldr8(x0, x1, x2, x3, :(x4, x5), x6, x7, x8)
new_index816(x0, x1, Succ(x2), Zero, x3)
new_rangeSize9(x0, x1, ty_Int)
new_rangeSize20(x0, x1, ty_@0)
new_enforceWHNF4(x0, x1, :(x2, x3))
new_index510(Integer(Pos(Succ(x0))), Integer(Pos(Zero)))
new_index514(x0, x1, Zero)
new_psPs2([], x0, x1, x2)
new_range23(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_primMulNat0(Zero, x0)
new_index1215(x0, x1, Zero)
new_index127(x0, x1, Succ(x2))
new_index128(x0, x1, Succ(x2), Succ(x3))
new_enforceWHNF4(x0, x1, [])
new_index1214(Pos(Succ(x0)), Pos(Succ(x1)))
new_primPlusInt15(Neg(x0), EQ)
new_rangeSize119(x0, x1, x2, x3, x4, x5, :(x6, x7), x8, x9, x10, x11, x12, x13)
new_rangeSize7(@2(Integer(Pos(Succ(x0))), Integer(Pos(Succ(x1)))))
new_index13(LT, LT)
new_index1214(Neg(Zero), Pos(Zero))
new_index1214(Pos(Zero), Neg(Zero))
new_index14(True, True)
new_enforceWHNF8(x0, x1, [])
new_primPlusNat0(Zero, Succ(x0))
new_index129(x0, Zero)
new_index512(x0, x1)
new_index1214(Neg(Succ(x0)), Neg(Succ(x1)))
new_primPlusInt(Pos(x0), True)
new_rangeSize21(@2(Neg(Succ(x0)), Neg(Succ(x1))))
new_rangeSize113(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_primPlusInt(Neg(x0), True)
new_index821(x0, x1, Neg(Succ(x2)), Pos(x3))
new_index821(x0, x1, Pos(Succ(x2)), Neg(x3))
new_index57(x0, Zero)
new_dsEm9(x0, x1, x2)
new_primPlusNat3(x0, Zero, x1)
new_index1(x0, x1, ty_Ordering)
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Neg(Zero))))
new_takeWhile20(x0, x1)
new_range19(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_range16(x0, x1, ty_Integer)
new_index0(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_range23(x0, x1, ty_Integer)
new_index1217(x0, x1)
new_range2(x0, x1, ty_Integer)
new_primPlusNat2(Succ(x0), Succ(x1), Succ(x2))
new_rangeSize117(x0, x1, [])
new_index817(x0, x1, Succ(x2), Succ(x3))
new_takeWhile8(Integer(Neg(Succ(x0))), Integer(Pos(Zero)))
new_takeWhile8(Integer(Pos(Succ(x0))), Integer(Neg(Zero)))
new_primPlusInt23(Succ(x0), Zero, Zero)
new_index83(x0, x1, Neg(Succ(x2)), x3)
new_takeWhile21(x0, x1, x2)
new_range3(x0, x1, app(app(ty_@2, x2), x3))
new_index88(x0, x1, Zero, x2, x3)
new_takeWhile7(Pos(Zero), Neg(Zero))
new_takeWhile7(Neg(Zero), Pos(Zero))
new_index510(Integer(Neg(Succ(x0))), Integer(Pos(Zero)))
new_range12(False, False)
new_rangeSize116(x0, x1, x2, x3, x4, x5)
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Pos(Succ(x0)))))
new_range1(x0, x1, ty_Int)
new_index0(x0, x1, ty_@0)
new_range2(x0, x1, ty_@0)
new_dsEm11(x0, x1)
new_range19(x0, x1, ty_Char)
new_fromEnum(Char(x0))
new_rangeSize119(x0, x1, x2, x3, x4, x5, [], :(x6, x7), x8, x9, x10, x11, x12)
new_range3(x0, x1, ty_Ordering)
new_index1214(Pos(Zero), Neg(Succ(x0)))
new_index510(Integer(Neg(Zero)), Integer(Neg(Succ(x0))))
new_index1214(Neg(Zero), Pos(Succ(x0)))
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Zero)))
new_range17(x0, x1, ty_Int)
new_range13(x0, x1, ty_Ordering)
new_index819(x0, x1, x2, Succ(x3))
new_range2(x0, x1, ty_Char)
new_foldr6(x0, x1, x2)
new_index0(x0, x1, app(app(ty_@2, x2), x3))
new_primPlusNat2(Succ(x0), Zero, Succ(x1))
new_takeWhile113(x0, x1, x2, Succ(x3), Succ(x4))
new_primPlusInt6(Pos(x0), LT)
new_index127(x0, x1, Zero)
new_rangeSize18([])
new_index510(Integer(Neg(Zero)), Integer(Neg(Zero)))
new_fromInteger(x0)
new_primPlusInt20(x0, Zero, Succ(x1))
new_primPlusNat2(Succ(x0), Zero, Zero)
new_takeWhile7(Pos(Zero), Pos(Zero))
new_seq(x0, x1, x2, x3)
new_primPlusInt23(Succ(x0), Succ(x1), Succ(x2))
new_error
new_dsEm7(x0, x1, x2)
new_index816(x0, x1, Zero, Zero, x2)
new_takeWhile110(x0, x1, x2, Succ(x3), Zero)
new_rangeSize111(x0, x1, Succ(x2), Succ(x3))
new_index0(x0, x1, ty_Char)
new_takeWhile8(Integer(Neg(Succ(x0))), Integer(Neg(Zero)))
new_rangeSize21(@2(Pos(Zero), Pos(Succ(x0))))
new_takeWhile7(Neg(Zero), Neg(Succ(x0)))
new_range19(x0, x1, app(app(ty_@2, x2), x3))
new_primMinusNat2(Succ(x0), x1, Zero)
new_takeWhile110(x0, x1, x2, Zero, Zero)
new_range13(x0, x1, ty_@0)
new_takeWhile7(Neg(Succ(x0)), Neg(Zero))
new_takeWhile19(x0, x1, Zero, Succ(x2))
new_range16(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_rangeSize119(x0, x1, x2, x3, x4, x5, [], [], x6, x7, x8, x9, x10)
new_range17(x0, x1, ty_Integer)
new_primPlusInt13(Neg(Succ(x0)))
new_index13(LT, EQ)
new_primPlusInt15(Neg(x0), GT)
new_index13(EQ, LT)
new_foldr11(x0, x1, [], x2, x3)
new_index85(x0, x1, Neg(Succ(x2)), x3)
new_primPlusInt23(Succ(x0), Succ(x1), Zero)
new_takeWhile7(Pos(x0), Neg(Succ(x1)))
new_takeWhile7(Neg(x0), Pos(Succ(x1)))
new_primPlusInt14(Neg(x0), True)
new_index511(x0, x1, Succ(x2), Succ(x3))
new_index1(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_takeWhile110(x0, x1, x2, Succ(x3), Succ(x4))
new_primMinusNat1(Zero)
new_range11(EQ, EQ)
new_index816(x0, x1, Zero, Succ(x2), x3)
new_primMinusNat3(x0, Zero)
new_map0(:(x0, x1))
new_ps3(x0, x1, x2, x3, x4, x5)
new_index7(x0, x1)
new_primPlusInt14(Pos(x0), True)
new_index13(EQ, GT)
new_rangeSize5(@2(True, False))
new_rangeSize5(@2(False, True))
new_range6(@3(x0, x1, x2), @3(x3, x4, x5), x6, x7, x8)
new_index13(GT, EQ)
new_takeWhile7(Pos(Zero), Pos(Succ(x0)))
new_enforceWHNF5(x0, x1, :(x2, x3))
new_rangeSize20(x0, x1, ty_Integer)
new_takeWhile113(x0, x1, x2, Zero, Zero)
new_primPlusInt6(Pos(x0), GT)
new_index811(x0, x1, x2, Succ(x3), x4)
new_primPlusInt(Pos(x0), False)
new_index510(Integer(Neg(Zero)), Integer(Pos(Succ(x0))))
new_index510(Integer(Pos(Zero)), Integer(Neg(Succ(x0))))
new_primPlusNat0(Succ(x0), Zero)
new_range9(x0, x1)
new_primPlusInt6(Neg(x0), GT)
new_primPlusNat0(Succ(x0), Succ(x1))
new_range23(x0, x1, ty_Int)
new_index14(False, False)
new_range3(x0, x1, ty_Bool)
new_index13(GT, LT)
new_index13(LT, GT)
new_rangeSize21(@2(Neg(Zero), Neg(Zero)))
new_range11(LT, LT)
new_foldr5(x0, x1, [], x2, x3, x4)
new_primIntToChar(Pos(x0))
new_rangeSize6(@2(GT, GT))
new_index1214(Pos(Zero), Pos(Succ(x0)))
new_takeWhile17(x0, x1, Zero, Succ(x2))
new_range22(x0, x1, ty_Int)
new_index87(x0, x1, Neg(Succ(x2)), x3)
new_sum(:(x0, x1))
new_primPlusInt10(x0)
new_primPlusInt21(x0, x1, x2)
new_takeWhile19(x0, x1, Succ(x2), Succ(x3))
new_primPlusInt(Neg(x0), False)
new_rangeSize9(x0, x1, ty_Char)
new_primPlusInt22(x0, Pos(x1), Pos(x2))
new_rangeSize21(@2(Neg(Zero), Neg(Succ(x0))))
new_primPlusInt20(x0, Succ(x1), Succ(x2))
new_ps(x0)
new_primMinusInt(Pos(x0), Pos(x1))
new_range1(x0, x1, ty_Char)
new_range20(@3(x0, x1, x2), @3(x3, x4, x5), x6, x7, x8)
new_dsEm12(x0, x1)
new_range19(x0, x1, ty_Bool)
new_index1214(Neg(Zero), Neg(Zero))
new_range1(x0, x1, ty_Ordering)
new_index87(x0, x1, Pos(Succ(x2)), x3)
new_primPlusInt18(Pos(x0), LT)
new_rangeSize114(x0, x1, x2, x3, [], [], x4, x5, x6, x7)
new_primPlusNat0(Zero, Zero)
new_index86(x0, x1, x2, Pos(x3), x4)
new_ps2
new_foldr4(x0, x1, x2, [], x3, x4, x5)
new_rangeSize114(x0, x1, x2, x3, [], :(x4, x5), x6, x7, x8, x9)
new_index0(x0, x1, ty_Ordering)
new_rangeSize6(@2(LT, LT))
new_rangeSize114(x0, x1, x2, x3, :(x4, x5), x6, x7, x8, x9, x10)
new_index83(x0, x1, Neg(Zero), x2)
new_index56(x0, x1, Zero)
new_rangeSize6(@2(GT, EQ))
new_rangeSize6(@2(EQ, GT))
new_rangeSize19(x0, x1, [])
new_takeWhile8(Integer(Pos(Zero)), Integer(Neg(Zero)))
new_takeWhile8(Integer(Neg(Zero)), Integer(Pos(Zero)))
new_range13(x0, x1, ty_Int)
new_primPlusInt15(Pos(x0), GT)
new_rangeSize5(@2(True, True))
new_primPlusNat2(Succ(x0), Succ(x1), Zero)
new_index1210(x0, x1, Zero, Zero)
new_rangeSize9(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_rangeSize21(@2(Neg(Succ(x0)), Neg(Zero)))
new_takeWhile7(Neg(Succ(x0)), Neg(Succ(x1)))
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Neg(Succ(x0)))))
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Pos(Succ(x0)))))
new_takeWhile8(Integer(Neg(Succ(x0))), Integer(Neg(Succ(x1))))
new_primMinusNat4(x0)
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Zero)))
new_dsEm10(x0, x1, x2)
new_enforceWHNF7(x0, x1, [])
new_takeWhile19(x0, x1, Succ(x2), Zero)
new_rangeSize2(@2(@3(x0, x1, x2), @3(x3, x4, x5)), x6, x7, x8)
new_range23(x0, x1, ty_Ordering)
new_primPlusInt18(Neg(x0), GT)
new_index57(x0, Succ(x1))
new_index510(Integer(Pos(Zero)), Integer(Pos(Zero)))
new_index821(x0, x1, Neg(Zero), Pos(Succ(x2)))
new_index821(x0, x1, Pos(Zero), Neg(Succ(x2)))
new_range3(x0, x1, ty_Integer)
new_index811(x0, x1, x2, Zero, x3)
new_primPlusInt18(Neg(x0), LT)
new_rangeSize21(@2(Neg(Zero), Pos(Zero)))
new_rangeSize21(@2(Pos(Zero), Neg(Zero)))
new_rangeSize7(@2(Integer(Pos(Succ(x0))), Integer(Neg(x1))))
new_rangeSize7(@2(Integer(Neg(Succ(x0))), Integer(Pos(x1))))
new_rangeSize6(@2(LT, GT))
new_rangeSize6(@2(GT, LT))
new_primPlusNat3(x0, Succ(x1), x2)
new_foldr9(x0, :(x1, x2), x3, x4)
new_rangeSize112(x0, x1)
new_rangeSize118(x0, x1, [])
new_rangeSize9(x0, x1, app(app(ty_@2, x2), x3))
new_takeWhile17(x0, x1, Succ(x2), Zero)
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Pos(Zero))))
new_index817(x0, x1, Zero, Succ(x2))
new_rangeSize7(@2(Integer(Pos(Zero)), Integer(Neg(Zero))))
new_rangeSize7(@2(Integer(Neg(Zero)), Integer(Pos(Zero))))
new_range7(@2(x0, x1), @2(x2, x3), x4, x5)
new_index821(x0, x1, Neg(Zero), Neg(Succ(x2)))
new_index511(x0, x1, Succ(x2), Zero)
new_range23(x0, x1, ty_@0)
new_index1214(Pos(Zero), Pos(Zero))
new_enforceWHNF8(x0, x1, :(x2, x3))
new_index1214(Pos(Succ(x0)), Neg(x1))
new_primPlusInt23(Zero, Succ(x0), Zero)
new_primPlusInt18(Pos(x0), EQ)
new_primPlusInt26(Neg(x0), x1, x2, x3, x4)
new_primPlusNat5(Zero)
new_primMinusNat2(Succ(x0), x1, Succ(x2))
new_index4(@3(x0, x1, x2), @3(x3, x4, x5), x6, x7, x8)
new_rangeSize7(@2(Integer(Pos(Succ(x0))), Integer(Pos(Zero))))
new_takeWhile7(Pos(Succ(x0)), Pos(Succ(x1)))
new_foldr8(x0, x1, x2, x3, [], x4, x5, x6)
new_index1212(x0, x1, Succ(x2))
new_index510(Integer(Neg(Succ(x0))), Integer(Neg(Zero)))
new_takeWhile7(Neg(Zero), Neg(Zero))
new_index812(x0, x1, x2)
new_index85(x0, x1, Pos(Succ(x2)), x3)
new_index1211(x0, x1)
new_index816(x0, x1, Succ(x2), Succ(x3), x4)
new_range2(x0, x1, app(app(ty_@2, x2), x3))
new_range23(x0, x1, ty_Bool)
new_range17(x0, x1, ty_Bool)
new_index0(x0, x1, ty_Int)
new_rangeSize20(x0, x1, ty_Bool)
new_index514(x0, x1, Succ(x2))
new_index1214(Neg(Succ(x0)), Pos(Succ(x1)))
new_enumFromTo(x0, x1)
new_rangeSize5(@2(False, False))
new_index515(x0, x1, Zero)
new_sum3([])
new_primPlusInt0(x0)
new_primPlusInt23(Zero, Zero, Zero)
new_takeWhile17(x0, x1, Succ(x2), Succ(x3))
new_index1214(Pos(Succ(x0)), Pos(Zero))
new_range12(True, True)
new_index511(x0, x1, Zero, Succ(x2))
new_index814(x0, x1)
new_index821(x0, x1, Neg(Zero), Neg(Zero))
new_range5(x0, x1, ty_Bool)
new_rangeSize3(@2(@0, @0))
new_primPlusInt24(x0, Pos(x1), Neg(x2))
new_primPlusInt24(x0, Neg(x1), Pos(x2))
new_takeWhile111(x0, x1, x2)
new_range22(x0, x1, ty_@0)
new_primMinusNat3(x0, Succ(x1))
new_primPlusNat2(Zero, Succ(x0), Succ(x1))
new_psPs2(:(x0, x1), x2, x3, x4)
new_range18(x0, x1, app(app(ty_@2, x2), x3))
new_primPlusInt23(Zero, Succ(x0), Succ(x1))
new_range5(x0, x1, ty_Integer)
new_index59(x0, x1)
new_range19(x0, x1, ty_Integer)
new_index813(x0, x1, x2)
new_ms(x0, x1)
new_range22(x0, x1, ty_Ordering)
new_index1(x0, x1, ty_Integer)
new_primMinusNat1(Succ(x0))
new_index129(x0, Succ(x1))
new_primPlusInt23(Succ(x0), Zero, Succ(x1))
new_takeWhile17(x0, x1, Zero, Zero)
new_range5(x0, x1, ty_Char)
new_range13(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_index(x0, x1, ty_Int)
new_foldr7
new_range18(x0, x1, ty_Char)
new_range10(x0, x1)
new_rangeSize20(x0, x1, app(app(ty_@2, x2), x3))
new_sum2(:(x0, x1))
new_primPlusInt13(Neg(Zero))
new_index(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_index515(x0, x1, Succ(x2))
new_primPlusNat1(Succ(x0), x1)
new_range2(x0, x1, ty_Ordering)
new_index821(x0, x1, Neg(Succ(x2)), Neg(x3))
new_primIntToChar(Neg(Zero))
new_range17(x0, x1, ty_@0)
new_index(x0, x1, app(app(ty_@2, x2), x3))
new_index9(@0, @0)
new_primPlusNat2(Zero, Succ(x0), Zero)
new_index820(x0, x1, Succ(x2), x3)
new_index128(x0, x1, Zero, Zero)
new_range18(x0, x1, ty_Int)
new_index85(x0, x1, Neg(Zero), x2)
new_rangeSize8(@2(x0, x1))
new_range21(@2(x0, x1), @2(x2, x3), x4, x5)
new_index85(x0, x1, Pos(Zero), x2)
new_index84(x0, x1, x2, Neg(x3), x4)
new_index88(x0, x1, Succ(x2), x3, x4)
new_primPlusInt16(x0)
new_enforceWHNF5(x0, x1, [])
new_takeWhile114(x0, x1, x2)
new_primPlusInt26(Pos(x0), x1, x2, x3, x4)
new_range3(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_enforceWHNF6(x0, x1, [])
new_ps7(x0)
new_foldl'
new_range17(x0, x1, ty_Ordering)
new_enforceWHNF7(x0, x1, :(x2, x3))
new_range18(x0, x1, ty_Ordering)
new_index821(x0, x1, Pos(Zero), Pos(Succ(x2)))
new_rangeSize16(x0, x1, x2, x3, x4, x5, [], x6, x7, x8, x9)
new_primPlusNat2(Zero, Zero, Zero)
new_index510(Integer(Pos(Succ(x0))), Integer(Neg(x1)))
new_primPlusInt18(Pos(x0), GT)
new_primPlusInt14(Neg(x0), False)
new_index1215(x0, x1, Succ(x2))
new_primPlusInt14(Pos(x0), False)
new_rangeSize9(x0, x1, ty_Ordering)
new_index86(x0, x1, x2, Neg(x3), x4)
new_primPlusInt18(Neg(x0), EQ)
new_rangeSize21(@2(Pos(Succ(x0)), Pos(Zero)))
new_sum1([])
new_index821(x0, x1, Pos(Succ(x2)), Pos(x3))
new_takeWhile8(Integer(Pos(Zero)), Integer(Pos(Succ(x0))))
new_index817(x0, x1, Succ(x2), Zero)
new_primPlusInt9(x0)
new_range23(x0, x1, ty_Char)
new_foldr4(x0, x1, x2, :(x3, x4), x5, x6, x7)
new_index(x0, x1, ty_Bool)
new_foldr11(x0, x1, :(x2, x3), x4, x5)
new_ps6(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_index82(x0, x1, x2)
new_range5(x0, x1, ty_Ordering)
new_index89(x0, x1)
new_index11(x0, x1)
new_index1212(x0, x1, Zero)
new_dsEm8(x0, x1)
new_index821(x0, x1, Pos(Zero), Pos(Zero))
new_range13(x0, x1, ty_Integer)
new_rangeSize9(x0, x1, ty_@0)
new_rangeSize7(@2(Integer(Neg(Succ(x0))), Integer(Neg(Succ(x1)))))
new_range3(x0, x1, ty_@0)
new_primPlusInt12(x0)
new_primMulNat0(Succ(x0), x1)
new_range3(x0, x1, ty_Int)
new_psPs1(:(x0, x1), x2, x3, x4, x5)
new_primPlusInt23(Zero, Zero, Succ(x0))
new_primPlusInt8(x0)
new_takeWhile22(x0, x1)
new_index(x0, x1, ty_Ordering)
new_index819(x0, x1, x2, Zero)
new_index84(x0, x1, x2, Pos(x3), x4)
new_primPlusInt24(x0, Neg(x1), Neg(x2))
new_index83(x0, x1, Pos(Zero), x2)
new_rangeSize111(x0, x1, Zero, Zero)
new_index1(x0, x1, ty_@0)
new_index1214(Neg(Succ(x0)), Neg(Zero))
new_rangeSize120(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_rangeSize111(x0, x1, Zero, Succ(x2))
new_primPlusNat2(Zero, Zero, Succ(x0))
new_primPlusInt6(Pos(x0), EQ)
new_primMinusNat0(Succ(x0), Zero)
new_takeWhile8(Integer(Pos(Succ(x0))), Integer(Pos(Zero)))
new_primPlusInt25(x0, x1, x2)
new_primIntToChar(Neg(Succ(x0)))
new_ps1(x0)
new_range13(x0, x1, ty_Bool)
new_range5(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_primPlusInt1(x0)
new_dsEm4(x0, x1, x2)
new_range11(LT, GT)
new_index510(Integer(Neg(Zero)), Integer(Pos(Zero)))
new_index510(Integer(Pos(Zero)), Integer(Neg(Zero)))
new_range11(GT, LT)
new_primMinusNat0(Zero, Succ(x0))
new_range19(x0, x1, ty_Ordering)
new_rangeSize110(x0, x1, x2, x3, :(x4, x5), x6, x7, x8)
new_index513(x0, Succ(x1))
new_index1(x0, x1, ty_Bool)
new_index14(True, False)
new_index14(False, True)
new_fromInt
new_sum1(:(x0, x1))
new_primMinusNat2(Zero, x0, x1)
new_primPlusInt15(Pos(x0), LT)
new_primPlusNat1(Zero, x0)
new_takeWhile8(Integer(Neg(Zero)), Integer(Neg(Succ(x0))))
new_primMinusInt(Pos(x0), Neg(x1))
new_primMinusInt(Neg(x0), Pos(x1))
new_index1214(Neg(Zero), Neg(Succ(x0)))
new_ps0
new_range16(x0, x1, ty_Int)
new_primMinusNat5(x0, Zero, x1)
new_index56(x0, x1, Succ(x2))
new_range2(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_range16(x0, x1, ty_Bool)
new_rangeSize20(x0, x1, ty_Ordering)
new_index1210(x0, x1, Succ(x2), Succ(x3))
new_takeWhile113(x0, x1, x2, Succ(x3), Zero)
new_index83(x0, x1, Pos(Succ(x2)), x3)
new_range3(x0, x1, ty_Char)
new_rangeSize6(@2(LT, EQ))
new_rangeSize6(@2(EQ, LT))
new_index58(x0, x1, Succ(x2), Succ(x3))
new_index126(x0, x1)
new_primPlusNat4(Succ(x0), x1)
new_takeWhile112(x0, x1)
new_range16(x0, x1, ty_Char)
new_index128(x0, x1, Succ(x2), Zero)
new_index1213(x0, Zero)
new_sum0(:(x0, x1))
new_range8(x0, x1)
new_index1(x0, x1, ty_Int)
new_primMinusNat5(x0, Succ(x1), x2)
new_dsEm6(x0, x1)
new_index87(x0, x1, Neg(Zero), x2)
new_primPlusInt6(Neg(x0), LT)
new_sum3(:(x0, x1))
new_primPlusInt15(Neg(x0), LT)
new_index810(x0, x1)
new_range17(x0, x1, ty_Char)
new_range16(x0, x1, ty_@0)
new_takeWhile19(x0, x1, Zero, Zero)
new_index87(x0, x1, Pos(Zero), x2)
new_rangeSize21(@2(Pos(Zero), Neg(Succ(x0))))
new_takeWhile7(Pos(Succ(x0)), Pos(Zero))
new_rangeSize21(@2(Neg(Zero), Pos(Succ(x0))))
new_index60(x0, x1)
new_range22(x0, x1, ty_Integer)
new_takeWhile18(x0, x1)
new_range16(x0, x1, app(app(ty_@2, x2), x3))
new_primPlusInt24(x0, Pos(x1), Pos(x2))
new_index58(x0, x1, Zero, Zero)
new_index1210(x0, x1, Zero, Succ(x2))
new_index10(x0, x1)
new_primPlusInt22(x0, Pos(x1), Neg(x2))
new_primPlusInt22(x0, Neg(x1), Pos(x2))
new_foldl'0(x0)
new_range18(x0, x1, ty_Bool)
new_map0([])
new_takeWhile113(x0, x1, x2, Zero, Succ(x3))
new_range2(x0, x1, ty_Bool)
new_index58(x0, x1, Zero, Succ(x2))
new_rangeSize20(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_foldr5(x0, x1, :(x2, x3), x4, x5, x6)
new_range5(x0, x1, app(app(ty_@2, x2), x3))
new_rangeSize115(x0, x1, x2, x3, x4, x5)
new_index815(x0, x1)
new_primPlusNat4(Zero, x0)
new_range13(x0, x1, app(app(ty_@2, x2), x3))
new_range19(x0, x1, ty_Int)
new_index510(Integer(Neg(Succ(x0))), Integer(Neg(Succ(x1))))
new_foldr9(x0, [], x1, x2)
new_range5(x0, x1, ty_@0)
new_index510(Integer(Neg(Succ(x0))), Integer(Pos(Succ(x1))))
new_rangeSize6(@2(EQ, EQ))
new_rangeSize21(@2(Neg(Succ(x0)), Pos(x1)))
new_rangeSize21(@2(Pos(Succ(x0)), Neg(x1)))
new_range22(x0, x1, ty_Bool)
new_index6(@2(x0, x1), @2(x2, x3), x4, x5)
new_takeWhile9(x0, x1, x2)
new_primMinusInt(Neg(x0), Neg(x1))
new_primPlusInt6(Neg(x0), EQ)
new_primPlusNat5(Succ(x0))
new_index(x0, x1, ty_Char)
new_enforceWHNF6(x0, x1, :(x2, x3))
new_range18(x0, x1, ty_Integer)
new_range1(x0, x1, ty_@0)
new_index13(GT, GT)
new_psPs3
new_range2(x0, x1, ty_Int)
new_rangeSize110(x0, x1, x2, x3, [], x4, x5, x6)
new_range13(x0, x1, ty_Char)
new_rangeSize21(@2(Pos(Zero), Pos(Zero)))
new_rangeSize117(x0, x1, :(x2, x3))
new_index817(x0, x1, Zero, Zero)
new_index821(x0, x1, Neg(Zero), Pos(Zero))
new_index821(x0, x1, Pos(Zero), Neg(Zero))
new_range5(x0, x1, ty_Int)
new_rangeSize20(x0, x1, ty_Char)
new_takeWhile8(Integer(Pos(Succ(x0))), Integer(Pos(Succ(x1))))
new_rangeSize18(:(x0, x1))
new_rangeSize4(@2(@2(x0, x1), @2(x2, x3)), x4, x5)
new_index1214(Neg(Succ(x0)), Pos(Zero))
new_range18(x0, x1, ty_@0)
new_range1(x0, x1, app(app(app(ty_@3, x2), x3), x4))
new_index510(Integer(Pos(Succ(x0))), Integer(Pos(Succ(x1))))
new_dsEm5(x0, x1)

We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_rangeSize11(zx62, zx63, zx64, zx65, zx66, zx67, [], :(zx700, zx701), be, bf, bg, bh, ca) → new_rangeSize12(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 9 >= 7, 10 >= 8, 11 >= 9
new_ps5(zx82, zx84, zx81, zx83, ef, ee) → new_primPlusInt19(new_index0(zx82, zx84, ef), zx82, zx84, new_index1(zx81, zx83, ee), ef)
The graph contains the following edges 1 >= 2, 2 >= 3, 5 >= 5
new_rangeSize(@2(@3(zx300, zx301, zx302), @3(zx310, zx311, zx312)), de, df, dg) → new_rangeSize10(zx300, zx301, zx302, zx310, zx311, zx312, new_range17(zx300, zx310, de), de, df, dg, de)
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3, 1 > 4, 1 > 5, 1 > 6, 2 >= 8, 3 >= 9, 4 >= 10, 2 >= 11
new_index2(@3(zx640, zx641, zx642), @3(zx670, zx671, zx672), cb, cc, cd) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
The graph contains the following edges 1 > 1, 2 > 2, 1 > 3, 2 > 4, 1 > 5, 2 > 6, 5 >= 7, 4 >= 8, 3 >= 9
new_rangeSize13(zx25, zx26, zx27, zx28, :(zx290, zx291), eb, ec, ed) → new_rangeSize14(zx25, zx26, zx27, zx28, new_foldr9(zx290, new_range19(zx26, zx28, ec), ed, ec), new_foldr11(zx26, zx28, zx291, ed, ec), eb, ec, ed, ec)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 6 >= 7, 7 >= 8, 8 >= 9, 7 >= 10
new_index3(@2(zx640, zx641), @2(zx670, zx671), ce, cf) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)
The graph contains the following edges 1 > 1, 2 > 2, 1 > 3, 2 > 4, 4 >= 5, 3 >= 6
new_rangeSize14(zx81, zx82, zx83, zx84, [], :(zx870, zx871), ee, ef, eg, eh) → new_rangeSize15(zx81, zx82, zx83, zx84, ee, ef)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 7 >= 5, 8 >= 6
new_rangeSize0(@2(@2(zx300, zx301), @2(zx310, zx311)), dh, ea) → new_rangeSize13(zx300, zx301, zx310, zx311, new_range18(zx300, zx310, dh), dh, ea, dh)
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3, 1 > 4, 2 >= 6, 3 >= 7, 2 >= 8
new_rangeSize10(zx12, zx13, zx14, zx15, zx16, zx17, :(zx180, zx181), ba, bb, bc, bd) → new_rangeSize11(zx12, zx13, zx14, zx15, zx16, zx17, new_foldr4(zx180, zx14, zx17, new_range16(zx13, zx16, bb), bd, bb, bc), new_foldr8(zx14, zx17, zx13, zx16, zx181, bd, bb, bc), ba, bb, bc, bd, bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 8 >= 9, 9 >= 10, 10 >= 11, 11 >= 12, 9 >= 13
new_rangeSize12(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg) → new_primPlusInt19(new_index(zx64, zx67, bg), zx64, zx67, new_ps3(zx63, zx66, zx62, zx65, bf, be), bg)
The graph contains the following edges 3 >= 2, 6 >= 3, 9 >= 5
new_rangeSize12(zx62, zx63, @3(zx640, zx641, zx642), zx65, zx66, @3(zx670, zx671, zx672), be, bf, app(app(app(ty_@3, cb), cc), cd)) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
The graph contains the following edges 3 > 1, 6 > 2, 3 > 3, 6 > 4, 3 > 5, 6 > 6, 9 > 7, 9 > 8, 9 > 9
new_ps4(zx64, zx67, zx63, zx66, zx62, zx65, bg, bf, be) → new_primPlusInt19(new_index(zx64, zx67, bg), zx64, zx67, new_ps3(zx63, zx66, zx62, zx65, bf, be), bg)
The graph contains the following edges 1 >= 2, 2 >= 3, 7 >= 5
new_ps4(@3(zx640, zx641, zx642), @3(zx670, zx671, zx672), zx63, zx66, zx62, zx65, app(app(app(ty_@3, cb), cc), cd), bf, be) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
The graph contains the following edges 1 > 1, 2 > 2, 1 > 3, 2 > 4, 1 > 5, 2 > 6, 7 > 7, 7 > 8, 7 > 9
new_rangeSize11(zx62, zx63, @3(zx640, zx641, zx642), zx65, zx66, @3(zx670, zx671, zx672), :(zx900, zx901), zx70, be, bf, app(app(app(ty_@3, cb), cc), cd), bh, ca) → new_ps4(zx642, zx672, zx641, zx671, zx640, zx670, cd, cc, cb)
The graph contains the following edges 3 > 1, 6 > 2, 3 > 3, 6 > 4, 3 > 5, 6 > 6, 11 > 7, 11 > 8, 11 > 9
new_rangeSize11(zx62, zx63, zx64, zx65, zx66, zx67, :(zx900, zx901), zx70, be, bf, bg, bh, ca) → new_primPlusInt19(new_index(zx64, zx67, bg), zx64, zx67, new_ps3(zx63, zx66, zx62, zx65, bf, be), bg)
The graph contains the following edges 3 >= 2, 6 >= 3, 11 >= 5
new_rangeSize15(zx81, zx82, zx83, zx84, ee, ef) → new_primPlusInt19(new_index0(zx82, zx84, ef), zx82, zx84, new_index1(zx81, zx83, ee), ef)
The graph contains the following edges 2 >= 2, 4 >= 3, 6 >= 5
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, ee, ef, eg, eh) → new_primPlusInt19(new_index0(zx82, zx84, ef), zx82, zx84, new_index1(zx81, zx83, ee), ef)
The graph contains the following edges 2 >= 2, 4 >= 3, 8 >= 5
new_ps5(zx82, zx84, zx81, zx83, ef, app(app(ty_@2, gb), gc)) → new_index3(zx81, zx83, gb, gc)
The graph contains the following edges 3 >= 1, 4 >= 2, 6 > 3, 6 > 4
new_ps5(zx82, zx84, zx81, zx83, app(app(ty_@2, fd), ff), ee) → new_index3(zx82, zx84, fd, ff)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 > 3, 5 > 4
new_ps5(zx82, zx84, zx81, zx83, app(app(app(ty_@3, fa), fb), fc), ee) → new_index2(zx82, zx84, fa, fb, fc)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 > 3, 5 > 4, 5 > 5
new_ps5(zx82, zx84, zx81, zx83, ef, app(app(app(ty_@3, fg), fh), ga)) → new_index2(zx81, zx83, fg, fh, ga)
The graph contains the following edges 3 >= 1, 4 >= 2, 6 > 3, 6 > 4, 6 > 5
new_primPlusInt19(Pos(zx1360), zx137, zx138, zx139, app(app(ty_@2, dc), dd)) → new_rangeSize0(@2(zx137, zx138), dc, dd)
The graph contains the following edges 5 > 2, 5 > 3
new_primPlusInt19(Neg(zx1360), zx137, zx138, zx139, app(app(ty_@2, dc), dd)) → new_rangeSize0(@2(zx137, zx138), dc, dd)
The graph contains the following edges 5 > 2, 5 > 3
new_primPlusInt19(Neg(zx1360), zx137, zx138, zx139, app(app(app(ty_@3, cg), da), db)) → new_rangeSize(@2(zx137, zx138), cg, da, db)
The graph contains the following edges 5 > 2, 5 > 3, 5 > 4
new_primPlusInt19(Pos(zx1360), zx137, zx138, zx139, app(app(app(ty_@3, cg), da), db)) → new_rangeSize(@2(zx137, zx138), cg, da, db)
The graph contains the following edges 5 > 2, 5 > 3, 5 > 4
new_rangeSize12(zx62, zx63, zx64, zx65, zx66, zx67, be, bf, bg) → new_ps5(zx63, zx66, zx62, zx65, bf, be)
The graph contains the following edges 2 >= 1, 5 >= 2, 1 >= 3, 4 >= 4, 8 >= 5, 7 >= 6
new_rangeSize12(zx62, zx63, @2(zx640, zx641), zx65, zx66, @2(zx670, zx671), be, bf, app(app(ty_@2, ce), cf)) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)
The graph contains the following edges 3 > 1, 6 > 2, 3 > 3, 6 > 4, 9 > 5, 9 > 6
new_ps4(@2(zx640, zx641), @2(zx670, zx671), zx63, zx66, zx62, zx65, app(app(ty_@2, ce), cf), bf, be) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)
The graph contains the following edges 1 > 1, 2 > 2, 1 > 3, 2 > 4, 7 > 5, 7 > 6
new_ps4(zx64, zx67, zx63, zx66, zx62, zx65, bg, bf, be) → new_ps5(zx63, zx66, zx62, zx65, bf, be)
The graph contains the following edges 3 >= 1, 4 >= 2, 5 >= 3, 6 >= 4, 8 >= 5, 9 >= 6
new_rangeSize11(zx62, zx63, zx64, zx65, zx66, zx67, :(zx900, zx901), zx70, be, bf, bg, bh, ca) → new_ps5(zx63, zx66, zx62, zx65, bf, be)
The graph contains the following edges 2 >= 1, 5 >= 2, 1 >= 3, 4 >= 4, 10 >= 5, 9 >= 6
new_rangeSize11(zx62, zx63, @2(zx640, zx641), zx65, zx66, @2(zx670, zx671), :(zx900, zx901), zx70, be, bf, app(app(ty_@2, ce), cf), bh, ca) → new_ps5(zx641, zx671, zx640, zx670, cf, ce)
The graph contains the following edges 3 > 1, 6 > 2, 3 > 3, 6 > 4, 11 > 5, 11 > 6
new_rangeSize15(zx81, zx82, zx83, zx84, ee, app(app(ty_@2, fd), ff)) → new_index3(zx82, zx84, fd, ff)
The graph contains the following edges 2 >= 1, 4 >= 2, 6 > 3, 6 > 4
new_rangeSize15(zx81, zx82, zx83, zx84, app(app(ty_@2, gb), gc), ef) → new_index3(zx81, zx83, gb, gc)
The graph contains the following edges 1 >= 1, 3 >= 2, 5 > 3, 5 > 4
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, ee, app(app(ty_@2, fd), ff), eg, eh) → new_index3(zx82, zx84, fd, ff)
The graph contains the following edges 2 >= 1, 4 >= 2, 8 > 3, 8 > 4
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, app(app(ty_@2, gb), gc), ef, eg, eh) → new_index3(zx81, zx83, gb, gc)
The graph contains the following edges 1 >= 1, 3 >= 2, 7 > 3, 7 > 4
new_rangeSize15(zx81, zx82, zx83, zx84, ee, app(app(app(ty_@3, fa), fb), fc)) → new_index2(zx82, zx84, fa, fb, fc)
The graph contains the following edges 2 >= 1, 4 >= 2, 6 > 3, 6 > 4, 6 > 5
new_rangeSize15(zx81, zx82, zx83, zx84, app(app(app(ty_@3, fg), fh), ga), ef) → new_index2(zx81, zx83, fg, fh, ga)
The graph contains the following edges 1 >= 1, 3 >= 2, 5 > 3, 5 > 4, 5 > 5
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, app(app(app(ty_@3, fg), fh), ga), ef, eg, eh) → new_index2(zx81, zx83, fg, fh, ga)
The graph contains the following edges 1 >= 1, 3 >= 2, 7 > 3, 7 > 4, 7 > 5
new_rangeSize14(zx81, zx82, zx83, zx84, :(zx950, zx951), zx87, ee, app(app(app(ty_@3, fa), fb), fc), eg, eh) → new_index2(zx82, zx84, fa, fb, fc)
The graph contains the following edges 2 >= 1, 4 >= 2, 8 > 3, 8 > 4, 8 > 5

Haskell To QDPs

case	lv2 of
	z1	→ concatMap (range1 z0 z1) (range (x2,y2))
	_	→ []

case	lv3 of
	z0	→ concatMap (range2 z0 x2 y2) (range (x1,y1))
	_	→ []

case	lv2 of
	z0	→ concatMap (range5 z0) (range (x1,y1))
	_	→ []

range20	z0 x2 y2 z1	= concatMap (range1 z0 z1) (range (x2,y2))
range20	z0 x2 y2 _	= []

range60	x1 y1 z0	= concatMap (range5 z0) (range (x1,y1))
range60	x1 y1 _	= []

range30	x2 y2 x1 y1 z0	= concatMap (range2 z0 x2 y2) (range (x1,y1))
range30	x2 y2 x1 y1 _	= []

index2	y x True	= sum (map (index0 y) (range (x,y)))
index2	y x False	= error []

index3	y x True	= sum (map (index1 y) (range (x,y)))
index3	y x False	= error []

compare1	x y True	= LT
compare1	x y False	= compare0 x y otherwise

compare2	x y True	= EQ
compare2	x y False	= compare1 x y (x <= y)

rangeSize1	vv vw True	= 0
rangeSize1	vv vw False	= rangeSize0 vv vw otherwise

takeWhile	p []	= takeWhile3 p []
takeWhile	p (x : xs)	= takeWhile2 p (x : xs)

takeWhile1	p x xs True	= x : takeWhile p xs
takeWhile1	p x xs False	= takeWhile0 p x xs otherwise

index5	wz xu i True	= fromInteger (i - wz)
index5	wz xu i False	= index4 wz xu i otherwise

index8	xv xw ci True	= fromEnum ci - fromEnum xv
index8	xv xw ci False	= index7 xv xw ci otherwise

index12	xx xy i True	= i - xx
index12	xx xy i False	= index11 xx xy i otherwise